{"id":"https://openalex.org/W2169459491","doi":"https://doi.org/10.1109/icdm.2003.1250968","title":"Fast PNN-based clustering using k-nearest neighbor graph","display_name":"Fast PNN-based clustering using k-nearest neighbor graph","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W2169459491","doi":"https://doi.org/10.1109/icdm.2003.1250968","mag":"2169459491"},"language":"en","primary_location":{"id":"doi:10.1109/icdm.2003.1250968","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2003.1250968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Third IEEE International Conference on Data Mining","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/A5037846871","display_name":"Pasi Fr\u00e4nti","orcid":"https://orcid.org/0000-0002-9554-2827"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. Franti","raw_affiliation_strings":["Department of Computer Science, University of Joensuu, Joensuu, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Joensuu, Joensuu, Finland","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018571563","display_name":"Olli Virmajoki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"O. Virmajoki","raw_affiliation_strings":["Department of Computer Science, University of Joensuu, Joensuu, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Joensuu, Joensuu, Finland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037259225","display_name":"Ville Hautam\u00e4ki","orcid":"https://orcid.org/0000-0002-5885-0003"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V. Hautamaki","raw_affiliation_strings":["Department of Computer Science, University of Joensuu, Joensuu, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Joensuu, Joensuu, Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037846871"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6638,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.85984572,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"525","last_page":"528"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9997000098228455,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9958000183105469,"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/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.8288692235946655},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7113987803459167},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6855390071868896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6170946955680847},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5939262509346008},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5689617395401001},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.562762975692749},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.545906126499176},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5373218655586243},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4196207821369171},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37676823139190674},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.29714739322662354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2897389531135559},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.21260040998458862},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17543888092041016}],"concepts":[{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.8288692235946655},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7113987803459167},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6855390071868896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6170946955680847},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5939262509346008},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5689617395401001},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.562762975692749},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.545906126499176},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5373218655586243},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4196207821369171},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37676823139190674},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.29714739322662354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2897389531135559},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.21260040998458862},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17543888092041016}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdm.2003.1250968","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2003.1250968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Third IEEE International Conference on Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W108464071","https://openalex.org/W2016381774","https://openalex.org/W2026609130","https://openalex.org/W2050572907","https://openalex.org/W2051293718","https://openalex.org/W2116965831","https://openalex.org/W2134383396","https://openalex.org/W2144405005","https://openalex.org/W2147647517","https://openalex.org/W2156097299"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W2375128115","https://openalex.org/W2795392346","https://openalex.org/W2969538544","https://openalex.org/W1558159560","https://openalex.org/W2351157934","https://openalex.org/W2148008870","https://openalex.org/W1595303882","https://openalex.org/W2011582495","https://openalex.org/W4246757943"],"abstract_inverted_index":{"Search":[0],"for":[1,22],"nearest":[2,19],"neighbor":[3,20],"is":[4,45,52],"the":[5,16,24,46,53,58,62,71],"main":[6],"source":[7],"of":[8,18,26,30,48,55],"computation":[9],"in":[10,57],"most":[11],"clustering":[12,67],"algorithms.":[13],"We":[14,60],"propose":[15],"use":[17],"graph":[21],"reducing":[23],"number":[25,29,47,54],"candidates.":[27],"The":[28],"distance":[31],"calculations":[32],"per":[33],"search":[34],"can":[35],"be":[36],"reduced":[37],"from":[38],"O(N)":[39],"to":[40],"O(k)":[41],"or":[42],"where":[43],"N":[44],"clusters,":[49],"and":[50],"k":[51],"neighbors":[56],"graph.":[59],"apply":[61],"proposed":[63],"scheme":[64],"within":[65],"agglomerative":[66],"algorithm":[68],"known":[69],"as":[70],"PNN":[72],"algorithm.":[73]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}