{"id":"https://openalex.org/W2034570777","doi":"https://doi.org/10.1109/isspa.2012.6310472","title":"CMUNE: A clustering using mutual nearest neighbors algorithm","display_name":"CMUNE: A clustering using mutual nearest neighbors algorithm","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2034570777","doi":"https://doi.org/10.1109/isspa.2012.6310472","mag":"2034570777"},"language":"en","primary_location":{"id":"doi:10.1109/isspa.2012.6310472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isspa.2012.6310472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5079434387","display_name":"Mohamed Abbas","orcid":"https://orcid.org/0000-0003-0197-4299"},"institutions":[{"id":"https://openalex.org/I59272784","display_name":"Arab Academy for Science, Technology, and Maritime Transport","ror":"https://ror.org/0004vyj87","country_code":"EG","type":"education","lineage":["https://openalex.org/I59272784"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Mohamed A. Abbas","raw_affiliation_strings":["Graduate student with the College of Computing, Information Technology Arab Academy for Science and Technology","Graduate student with the College of Computing and Information Technology, Arab Academy for Science and Technology, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate student with the College of Computing, Information Technology Arab Academy for Science and Technology","institution_ids":["https://openalex.org/I59272784"]},{"raw_affiliation_string":"Graduate student with the College of Computing and Information Technology, Arab Academy for Science and Technology, Egypt","institution_ids":["https://openalex.org/I59272784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048030732","display_name":"Amin Shoukry","orcid":"https://orcid.org/0000-0002-8024-3795"},"institutions":[{"id":"https://openalex.org/I32619867","display_name":"Egypt-Japan University of Science and Technology","ror":"https://ror.org/02x66tk73","country_code":"EG","type":"education","lineage":["https://openalex.org/I32619867"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Amin A. Shoukry","raw_affiliation_strings":["Computer Science and Engineering Dept., Technology New Borg-El-Arab City, Alexandria, Egypt","Computer Science and Engineering Dept., Egypt-Japan University of Science and Technology, New Borg-El-Arab City, Alexandria, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Dept., Technology New Borg-El-Arab City, Alexandria, Egypt","institution_ids":[]},{"raw_affiliation_string":"Computer Science and Engineering Dept., Egypt-Japan University of Science and Technology, New Borg-El-Arab City, Alexandria, Egypt","institution_ids":["https://openalex.org/I32619867"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7805,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.69169289,"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":"1192","last_page":"1197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994000196456909,"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/T11106","display_name":"Data Management and Algorithms","score":0.9951000213623047,"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/T10057","display_name":"Face and Expression Recognition","score":0.9950000047683716,"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/dbscan","display_name":"DBSCAN","score":0.8191803693771362},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.7533204555511475},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.741674542427063},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5813469290733337},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5624304413795471},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5549213290214539},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5548290014266968},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5252755880355835},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5196153521537781},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4706401526927948},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.46430376172065735},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.45172542333602905},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.42103612422943115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3414180278778076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32223308086395264},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08622023463249207}],"concepts":[{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.8191803693771362},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.7533204555511475},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.741674542427063},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5813469290733337},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5624304413795471},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5549213290214539},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5548290014266968},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5252755880355835},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5196153521537781},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4706401526927948},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.46430376172065735},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.45172542333602905},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.42103612422943115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3414180278778076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32223308086395264},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08622023463249207}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isspa.2012.6310472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isspa.2012.6310472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W80917968","https://openalex.org/W1673310716","https://openalex.org/W2040937600","https://openalex.org/W2067021889","https://openalex.org/W2089923519","https://openalex.org/W2099097464","https://openalex.org/W2126337883","https://openalex.org/W2138615112","https://openalex.org/W2165558283","https://openalex.org/W2319660501","https://openalex.org/W3112020351","https://openalex.org/W4205864049","https://openalex.org/W4235169531","https://openalex.org/W4285719527","https://openalex.org/W4386050995","https://openalex.org/W6686795832"],"related_works":["https://openalex.org/W2394193399","https://openalex.org/W2054669762","https://openalex.org/W2809859387","https://openalex.org/W2387373525","https://openalex.org/W2014841791","https://openalex.org/W2355615404","https://openalex.org/W2353158678","https://openalex.org/W2998469710","https://openalex.org/W2374506950","https://openalex.org/W2381835990"],"abstract_inverted_index":{"A":[0],"novel":[1],"clustering":[2,83,90],"algorithm":[3,36,116],"CMune":[4,78],"is":[5,79,87],"presented":[6],"for":[7,45],"the":[8,32,46,69,158],"purpose":[9],"of":[10,13,31,53,93,107,123,146,160],"finding":[11],"clusters":[12,73],"arbitrary":[14],"shapes,":[15],"sizes":[16],"and":[17,102,110,125,141],"densities":[18],"in":[19,38,48],"high":[20,126],"dimensional":[21,127],"feature":[22],"spaces.":[23],"It":[24],"can":[25],"be":[26],"considered":[27,62],"as":[28,63,137,149,151],"a":[29,56,81,88,121],"variation":[30],"Shared":[33],"Nearest":[34],"Neighbor":[35],"(SNN),":[37],"which":[39,72],"each":[40],"sample":[41],"data":[42,128],"point":[43],"votes":[44],"points":[47,54,101],"its":[49,94,147,152],"k-nearest":[50],"neighborhood.":[51],"Sets":[52],"sharing":[55],"common":[57],"mutual":[58],"nearest":[59],"neighbor":[60],"are":[61,68],"dense":[64],"regions/blocks.":[65],"These":[66],"blocks":[67,106,112],"seeds":[70],"from":[71,97],"may":[74],"grow":[75],"up.":[76],"Therefore,":[77],"not":[80],"point-to-point":[82],"algorithm.":[84],"Rather,":[85],"it":[86,156],"block-to-block":[89],"technique.":[91],"Much":[92],"advantages":[95],"come":[96],"this":[98],"fact:":[99],"Noise":[100],"outliers":[103],"correspond":[104],"to":[105,120],"small":[108],"sizes,":[109],"homogeneous":[111],"highly":[113],"overlap.":[114],"The":[115,144],"has":[117],"been":[118],"applied":[119],"variety":[122],"low":[124],"sets":[129],"with":[130],"superior":[131],"results":[132,148],"over":[133],"existing":[134],"techniques":[135],"such":[136],"K-means,":[138],"DBScan,":[139],"Mitosis":[140],"Spectral":[142],"clustering.":[143],"quality":[145],"well":[150],"time":[153],"complexity,":[154],"place":[155],"at":[157],"front":[159],"these":[161],"techniques.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}