{"id":"https://openalex.org/W2749124900","doi":"https://doi.org/10.1145/3095713.3095717","title":"Efficient Approximate Medoids of Temporal Sequences","display_name":"Efficient Approximate Medoids of Temporal Sequences","publication_year":2017,"publication_date":"2017-06-19","ids":{"openalex":"https://openalex.org/W2749124900","doi":"https://doi.org/10.1145/3095713.3095717","mag":"2749124900"},"language":"en","primary_location":{"id":"doi:10.1145/3095713.3095717","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3095713.3095717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Workshop on Content-Based Multimedia Indexing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072233507","display_name":"Werner Bailer","orcid":"https://orcid.org/0000-0003-2442-4900"},"institutions":[{"id":"https://openalex.org/I13402291","display_name":"Joanneum Research","ror":"https://ror.org/049bdss47","country_code":"AT","type":"facility","lineage":["https://openalex.org/I13402291"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Werner Bailer","raw_affiliation_strings":["JOANNEUM RESEARCH, DIGITAL - Institute for Information and Communication Technologies, Graz, Austria"],"affiliations":[{"raw_affiliation_string":"JOANNEUM RESEARCH, DIGITAL - Institute for Information and Communication Technologies, Graz, Austria","institution_ids":["https://openalex.org/I13402291"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072233507"],"corresponding_institution_ids":["https://openalex.org/I13402291"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1109993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11439","display_name":"Video Analysis and Summarization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11439","display_name":"Video Analysis and Summarization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/medoid","display_name":"Medoid","score":0.972216784954071},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7185513973236084},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.660312294960022},{"id":"https://openalex.org/keywords/k-medoids","display_name":"k-medoids","score":0.5809142589569092},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5754402875900269},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5727621912956238},{"id":"https://openalex.org/keywords/data-set","display_name":"Data set","score":0.5111938118934631},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.49442553520202637},{"id":"https://openalex.org/keywords/visualization","display_name":"Visualization","score":0.4859086573123932},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4109693467617035},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.39177632331848145},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3880089223384857},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3704689145088196},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3220999836921692},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.12099218368530273},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10367664694786072},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.08652585744857788}],"concepts":[{"id":"https://openalex.org/C63085389","wikidata":"https://www.wikidata.org/wiki/Q4287912","display_name":"Medoid","level":3,"score":0.972216784954071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7185513973236084},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.660312294960022},{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"score":0.5809142589569092},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5754402875900269},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5727621912956238},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.5111938118934631},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.49442553520202637},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.4859086573123932},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4109693467617035},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39177632331848145},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3880089223384857},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3704689145088196},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3220999836921692},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.12099218368530273},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10367664694786072},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.08652585744857788},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3095713.3095717","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3095713.3095717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Workshop on Content-Based Multimedia Indexing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1539846213","https://openalex.org/W1587329415","https://openalex.org/W1767929998","https://openalex.org/W2126626732","https://openalex.org/W2144119741","https://openalex.org/W2151103935","https://openalex.org/W2237415976","https://openalex.org/W2915649242"],"related_works":["https://openalex.org/W3133849001","https://openalex.org/W1481798977","https://openalex.org/W2380053301","https://openalex.org/W4225615903","https://openalex.org/W2143329214","https://openalex.org/W2758138366","https://openalex.org/W2605300748","https://openalex.org/W1969148276","https://openalex.org/W2393988099","https://openalex.org/W2083620785"],"abstract_inverted_index":{"In":[0,35],"order":[1],"to":[2,17],"compactly":[3],"represent":[4],"a":[5,22,46,54,60,106,116],"set":[6,39],"of":[7,33,40,59,65,101,115],"data,":[8,37],"its":[9,121],"medoid":[10,67,85,114],"(the":[11],"element":[12],"with":[13],"minimum":[14],"summed":[15],"distance":[16,74],"all":[18],"other":[19],"elements)":[20],"is":[21,42,78],"useful":[23],"choice.":[24],"This":[25],"has":[26],"applications":[27],"in":[28,48,90],"clustering,":[29],"compression":[30],"and":[31,119],"visualisation":[32],"data.":[34],"multimedia":[36],"the":[38,66,73],"data":[41,127],"often":[43],"sampled":[44],"as":[45,53],"sequence":[47,118],"time":[49],"or":[50,57],"space,":[51],"such":[52],"video":[55,126],"shot":[56],"views":[58],"scene.":[61],"The":[62],"exact":[63],"calculation":[64],"may":[68],"be":[69],"costly,":[70],"especially":[71],"if":[72],"function":[75],"between":[76],"elements":[77],"not":[79,96],"trivial.":[80],"While":[81],"approximation":[82],"methods":[83],"for":[84,109],"selection":[86],"exist,":[87],"we":[88],"show":[89],"this":[91],"work":[92],"that":[93],"they":[94],"do":[95],"perform":[97],"well":[98],"on":[99,123],"sequences":[100],"images.":[102],"We":[103],"thus":[104],"propose":[105],"novel":[107],"algorithm":[108],"efficiently":[110],"selecting":[111],"an":[112],"approximate":[113],"temporal":[117],"assess":[120],"performance":[122],"two":[124],"large-scale":[125],"sets.":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}