{"id":"https://openalex.org/W2554676448","doi":"https://doi.org/10.1109/ijcnn.2016.7727595","title":"Distributed mean shift clustering with approximate nearest neighbours","display_name":"Distributed mean shift clustering with approximate nearest neighbours","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2554676448","doi":"https://doi.org/10.1109/ijcnn.2016.7727595","mag":"2554676448"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2016.7727595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2016.7727595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Joint Conference on Neural Networks (IJCNN)","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/A5001516070","display_name":"Ga\u00ebl Beck","orcid":"https://orcid.org/0000-0002-5228-2666"},"institutions":[{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Ga\u00ebl Beck","raw_affiliation_strings":["Computer Science Laboratory (LIPN), University Paris-North - 13, F-93430 Villetaneuse, France","Computer Science Laboratory (LIPN), University Paris-North - Paris 13, France"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory (LIPN), University Paris-North - 13, F-93430 Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]},{"raw_affiliation_string":"Computer Science Laboratory (LIPN), University Paris-North - Paris 13, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022060377","display_name":"Tarn Duong","orcid":"https://orcid.org/0000-0002-1198-3482"},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Tarn Duong","raw_affiliation_strings":["Computer Science Laboratory (LIPN), University Paris-North - 13, F-93430 Villetaneuse, France","Computer Science Laboratory (LIPN), University Paris-North - Paris 13, France"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory (LIPN), University Paris-North - 13, F-93430 Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]},{"raw_affiliation_string":"Computer Science Laboratory (LIPN), University Paris-North - Paris 13, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113698150","display_name":"Hanene Azzag","orcid":null},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hanene Azzag","raw_affiliation_strings":["Computer Science Laboratory (LIPN), University Paris-North - 13, F-93430 Villetaneuse, France","Computer Science Laboratory (LIPN), University Paris-North - Paris 13, France"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory (LIPN), University Paris-North - 13, F-93430 Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]},{"raw_affiliation_string":"Computer Science Laboratory (LIPN), University Paris-North - Paris 13, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023422312","display_name":"Mustapha Lebbah","orcid":"https://orcid.org/0000-0001-7245-6371"},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mustapha Lebbah","raw_affiliation_strings":["Computer Science Laboratory (LIPN), University Paris-North - 13, F-93430 Villetaneuse, France","Computer Science Laboratory (LIPN), University Paris-North - Paris 13, France"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory (LIPN), University Paris-North - 13, F-93430 Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]},{"raw_affiliation_string":"Computer Science Laboratory (LIPN), University Paris-North - Paris 13, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5001516070"],"corresponding_institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"],"apc_list":null,"apc_paid":null,"fwci":0.668,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77860943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3110","last_page":"3115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9836000204086304,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9836000204086304,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9797999858856201,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9634000062942505,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.8583245277404785},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7932261228561401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6952269077301025},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5466521382331848},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5393391251564026},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4747234582901001},{"id":"https://openalex.org/keywords/distributed-database","display_name":"Distributed database","score":0.4461122155189514},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.4392687976360321},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.41337817907333374},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.3876366913318634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38709557056427},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.38579288125038147},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.3546026349067688},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.33825814723968506},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26508378982543945},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1494937539100647}],"concepts":[{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.8583245277404785},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7932261228561401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6952269077301025},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5466521382331848},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5393391251564026},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4747234582901001},{"id":"https://openalex.org/C70061542","wikidata":"https://www.wikidata.org/wiki/Q989016","display_name":"Distributed database","level":2,"score":0.4461122155189514},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.4392687976360321},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.41337817907333374},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.3876366913318634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38709557056427},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.38579288125038147},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.3546026349067688},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.33825814723968506},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26508378982543945},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1494937539100647},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2016.7727595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2016.7727595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Joint Conference on Neural Networks (IJCNN)","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":21,"referenced_works":["https://openalex.org/W44717426","https://openalex.org/W1905316980","https://openalex.org/W2011832962","https://openalex.org/W2020498246","https://openalex.org/W2050913223","https://openalex.org/W2052811446","https://openalex.org/W2067191022","https://openalex.org/W2092998534","https://openalex.org/W2093918678","https://openalex.org/W2131975293","https://openalex.org/W2132001627","https://openalex.org/W2147717514","https://openalex.org/W2162006472","https://openalex.org/W2164500538","https://openalex.org/W2173213060","https://openalex.org/W2397770138","https://openalex.org/W2475020214","https://openalex.org/W2964078813","https://openalex.org/W4235169531","https://openalex.org/W4256068510","https://openalex.org/W6679815717"],"related_works":["https://openalex.org/W2135779989","https://openalex.org/W2144265691","https://openalex.org/W2754607325","https://openalex.org/W144856782","https://openalex.org/W2080135560","https://openalex.org/W2147226516","https://openalex.org/W2360225591","https://openalex.org/W2975588143","https://openalex.org/W2010970209","https://openalex.org/W2752074276"],"abstract_inverted_index":{"We":[0],"introduce":[1,57],"an":[2,97],"efficient":[3,98],"distributed":[4,90],"implementation":[5,41],"of":[6,17,42,67,71],"nearest":[7,72,81],"neighbour":[8,82],"mean":[9],"shift":[10],"clustering":[11,32],"(NNMS).":[12],"The":[13],"computationally":[14],"intensive":[15],"nature":[16],"NNMS":[18,46],"has":[19],"so":[20,55],"far":[21],"restricted":[22],"its":[23,49],"application":[24],"to":[25,79],"complex":[26],"data":[27],"sets":[28],"where":[29],"a":[30,62,88],"flexible":[31],"with":[33],"non-ellipsoidal":[34],"clusters":[35],"would":[36],"be":[37],"beneficial.":[38],"A":[39],"parallel":[40],"the":[43,68,94],"standard":[44],"serial":[45],"algorithm":[47,91],"on":[48],"own":[50],"brings":[51],"insufficient":[52],"performance":[53],"gains":[54],"we":[56],"two":[58],"further":[59],"algorithmic":[60],"improvements:":[61],"normal":[63],"scale":[64],"(NS)":[65],"choice":[66],"optimal":[69],"number":[70],"neighbours,":[73],"and":[74],"locality":[75],"sensitive":[76],"hashing":[77],"(LSH)":[78],"approximate":[80],"searches.":[83],"Combining":[84],"these":[85],"improvements":[86],"into":[87],"single":[89],"DNNMS":[92],"offers":[93],"potential":[95],"for":[96,100],"method":[99],"Big":[101],"Data":[102],"Clustering.":[103]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
