{"id":"https://openalex.org/W2891664841","doi":"https://doi.org/10.1109/icra.2018.8460939","title":"Path Clustering with Homology Area","display_name":"Path Clustering with Homology Area","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2891664841","doi":"https://doi.org/10.1109/icra.2018.8460939","mag":"2891664841"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2018.8460939","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","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/A5053233736","display_name":"J. Frederico Carvalho","orcid":"https://orcid.org/0000-0002-8750-0897"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"J. Frederico Carvalho","raw_affiliation_strings":["CAS/RPL, Royal Institute of Technology, Stocholm, Sweden"],"affiliations":[{"raw_affiliation_string":"CAS/RPL, Royal Institute of Technology, Stocholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049695343","display_name":"Mikael Vejdemo\u2010Johansson","orcid":"https://orcid.org/0000-0001-6322-7542"},"institutions":[{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mikael Vejdemo-Johansson","raw_affiliation_strings":["Computer Science, CUNY Graduate Center, New York, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science, CUNY Graduate Center, New York, USA","institution_ids":["https://openalex.org/I121847817"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023792180","display_name":"Danica Kragi\u0107","orcid":"https://orcid.org/0000-0003-2965-2953"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Danica Kragic","raw_affiliation_strings":["CAS/RPL, Royal Institute of Technology, Stocholm, Sweden"],"affiliations":[{"raw_affiliation_string":"CAS/RPL, Royal Institute of Technology, Stocholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018027629","display_name":"Florian T. Pokorny","orcid":"https://orcid.org/0000-0003-1114-6040"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Florian T. Pokorny","raw_affiliation_strings":["CAS/RPL, Royal Institute of Technology, Stocholm, Sweden"],"affiliations":[{"raw_affiliation_string":"CAS/RPL, Royal Institute of Technology, Stocholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5053233736"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.2019,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54525562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"34","issue":null,"first_page":"7346","last_page":"7353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10799","display_name":"Data Visualization and Analytics","score":0.9916999936103821,"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/cluster-analysis","display_name":"Cluster analysis","score":0.7253361940383911},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.718782365322113},{"id":"https://openalex.org/keywords/homology","display_name":"Homology (biology)","score":0.6590756177902222},{"id":"https://openalex.org/keywords/persistent-homology","display_name":"Persistent homology","score":0.589007556438446},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.551196277141571},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49417975544929504},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4753822386264801},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.46279406547546387},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4570995569229126},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45076924562454224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34187448024749756},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3252842426300049},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22715628147125244},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.07044139504432678},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.0699813961982727}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7253361940383911},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.718782365322113},{"id":"https://openalex.org/C165525559","wikidata":"https://www.wikidata.org/wiki/Q224180","display_name":"Homology (biology)","level":3,"score":0.6590756177902222},{"id":"https://openalex.org/C2874115","wikidata":"https://www.wikidata.org/wiki/Q17099562","display_name":"Persistent homology","level":2,"score":0.589007556438446},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.551196277141571},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49417975544929504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4753822386264801},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.46279406547546387},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4570995569229126},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45076924562454224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34187448024749756},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3252842426300049},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22715628147125244},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.07044139504432678},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0699813961982727},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2018.8460939","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1663973292","https://openalex.org/W1894414046","https://openalex.org/W1966554111","https://openalex.org/W1985364430","https://openalex.org/W2009086942","https://openalex.org/W2097897435","https://openalex.org/W2126419445","https://openalex.org/W2128534087","https://openalex.org/W2133235827","https://openalex.org/W2144994235","https://openalex.org/W2155295407","https://openalex.org/W2161190103","https://openalex.org/W2163145488","https://openalex.org/W2414919613","https://openalex.org/W2524241275","https://openalex.org/W3040586665","https://openalex.org/W3099533866","https://openalex.org/W4211008118","https://openalex.org/W4295306962"],"related_works":["https://openalex.org/W3162517897","https://openalex.org/W4360887047","https://openalex.org/W2102692026","https://openalex.org/W2958601279","https://openalex.org/W4206186921","https://openalex.org/W3143913977","https://openalex.org/W2770791287","https://openalex.org/W4386755584","https://openalex.org/W3005059017","https://openalex.org/W2745914844"],"abstract_inverted_index":{"Path":[0],"clustering":[1,62],"has":[2],"found":[3],"many":[4],"applications":[5],"in":[6,60,79],"recent":[7],"years.":[8],"Common":[9],"approaches":[10],"to":[11,21,103,112],"this":[12],"problem":[13],"use":[14],"aggregates":[15],"of":[16,25,45,74,101,107,116,123,128,134,142],"the":[17,33,43,46,49,87,91,99,105,121],"distances":[18],"between":[19,27,76],"points":[20],"provide":[22],"a":[23,72,80,114,131,140],"measure":[24,73],"dissimilarity":[26],"paths":[28,50,78],"which":[29],"do":[30,38],"not":[31,39],"satisfy":[32],"triangle":[34,92],"inequality.":[35],"Furthermore,":[36],"they":[37],"take":[40],"into":[41],"account":[42],"topology":[44],"space":[47],"where":[48],"are":[51],"embedded.":[52],"To":[53],"tackle":[54],"this,":[55],"we":[56,84,96],"extend":[57],"previous":[58],"work":[59],"path":[61],"with":[63,126],"relative":[64],"homology,":[65],"by":[66],"employing":[67],"minimum":[68],"homology":[69,102],"area":[70],"as":[71,136,138],"distance":[75,89,109],"homologous":[77],"triangulated":[81],"mesh.":[82],"Further,":[83],"show":[85],"that":[86,127],"resulting":[88],"satisfies":[90],"inequality,":[93],"and":[94],"how":[95],"can":[97],"exploit":[98],"properties":[100],"reduce":[104],"amount":[106],"pairwise":[108],"calculations":[110],"necessary":[111],"cluster":[113],"set":[115],"paths.":[117,144],"We":[118],"further":[119],"compare":[120],"output":[122],"our":[124],"algorithm":[125],"DTW":[129],"on":[130,139],"toy":[132],"dataset":[133,141],"paths,":[135],"well":[137],"real-world":[143]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}