{"id":"https://openalex.org/W4249166706","doi":"https://doi.org/10.1002/9781119701859.ch9","title":"Cluster Analysis","display_name":"Cluster Analysis","publication_year":2021,"publication_date":"2021-02-24","ids":{"openalex":"https://openalex.org/W4249166706","doi":"https://doi.org/10.1002/9781119701859.ch9"},"language":"en","primary_location":{"id":"doi:10.1002/9781119701859.ch9","doi":"https://doi.org/10.1002/9781119701859.ch9","is_oa":false,"landing_page_url":"https://doi.org/10.1002/9781119701859.ch9","pdf_url":null,"source":{"id":"https://openalex.org/S4210226731","display_name":"Big Data","issn_l":"2167-6461","issn":["2167-6461","2167-647X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","doyens","jufo-1","medline","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320443","host_organization_name":"Mary Ann Liebert, Inc.","host_organization_lineage":["https://openalex.org/P4310320443","https://openalex.org/P4310320017"],"host_organization_lineage_names":["Mary Ann Liebert, Inc.","SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Big Data","raw_type":"other"},"volume":{"id":"https://openalex.org/W3136533351","display_name":"Big Data"},"type":"book-chapter","is_traditional":true,"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/A5113313833","display_name":"Balamurugan Balusamy","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Balamurugan Balusamy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018435242","display_name":"R. Nandhini Abirami","orcid":"https://orcid.org/0000-0001-8610-9629","observed_orcids":["https://orcid.org/0000-0001-8610-9629"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R Nandhini Abirami","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002855381","display_name":"Seifedine Kadry","orcid":"https://orcid.org/0000-0002-1939-4842","observed_orcids":["https://orcid.org/0000-0002-1939-4842","https://orcid.org/0000-0001-8080-7952"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seifedine Kadry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039341855","display_name":"Amir H. Gandomi","orcid":"https://orcid.org/0000-0002-2798-0104","observed_orcids":["https://orcid.org/0000-0002-2798-0104"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amir H. Gandomi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0149,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76235502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"259","last_page":"292"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":9.999999747378752e-05,"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/clustering","display_name":"clustering","score":0.9240000247955322},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"hierarchical clustering","score":0.996999979019165},{"id":"https://openalex.org/keywords/agglomerative-hierarchical-clustering","display_name":"agglomerative clustering","score":1.0},{"id":"https://openalex.org/keywords/divisive-clustering","display_name":"divisive clustering","score":1.0},{"id":"https://openalex.org/keywords/hard-clustering","display_name":"hard clustering","score":0.968999981880188},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"fuzzy clustering","score":0.9980000257492065},{"id":"https://openalex.org/keywords/k-means-clustering","display_name":"K-means clustering","score":0.875},{"id":"https://openalex.org/keywords/outlier-detection","display_name":"outlier detection","score":0.9890000224113464},{"id":"https://openalex.org/keywords/unsupervised-anomaly-detection","display_name":"unsupervised anomaly detection","score":0.9900000095367432}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8720130920410156},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.7985655069351196},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.7011370658874512},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.6863889098167419},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.6533135175704956},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.635100245475769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6189828515052795},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5926696062088013},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.5744313597679138},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.5277308225631714},{"id":"https://openalex.org/C23822008","wikidata":"https://www.wikidata.org/wiki/Q5156437","display_name":"Complete-linkage clustering","level":5,"score":0.5211451053619385},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4983792304992676},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.4874753952026367},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.46209895610809326},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.46192213892936707},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.45050859451293945},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.4240071475505829},{"id":"https://openalex.org/C146599234","wikidata":"https://www.wikidata.org/wiki/Q511093","display_name":"Centroid","level":2,"score":0.42126116156578064},{"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.1002/9781119701859.ch9","doi":"https://doi.org/10.1002/9781119701859.ch9","is_oa":false,"landing_page_url":"https://doi.org/10.1002/9781119701859.ch9","pdf_url":null,"source":{"id":"https://openalex.org/S4210226731","display_name":"Big Data","issn_l":"2167-6461","issn":["2167-6461","2167-647X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","doyens","jufo-1","medline","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320443","host_organization_name":"Mary Ann Liebert, Inc.","host_organization_lineage":["https://openalex.org/P4310320443","https://openalex.org/P4310320017"],"host_organization_lineage_names":["Mary Ann Liebert, Inc.","SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Big Data","raw_type":"other"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4383960255","https://openalex.org/W35771018","https://openalex.org/W3020292803","https://openalex.org/W2953704715","https://openalex.org/W7217205172","https://openalex.org/W2762431226","https://openalex.org/W4236574629","https://openalex.org/W4285199198","https://openalex.org/W4409727145","https://openalex.org/W3211298820"],"abstract_inverted_index":{"Clustering":[0,18],"is":[1,30,39],"a":[2,40,46,51],"machine":[3],"learning":[4],"tool":[5],"used":[6,21],"to":[7,33,97],"cluster":[8,48,54,100],"similar":[9],"data":[10,35,93,116,120,140],"based":[11,101,134],"on":[12,102,135],"the":[13,23,27,34,106,109,114,136],"similarities":[14],"in":[15,122],"its":[16],"characteristics.":[17],"techniques":[19,133],"are":[20,63,76,95,127],"when":[22],"specific":[24],"target":[25],"or":[26,49],"expected":[28],"output":[29],"not":[31],"known":[32],"analyst.":[36],"Hierarchical":[37],"clustering":[38,83,112],"series":[41],"of":[42,66,79,108,130,138],"partitions":[43,113],"running":[44],"from":[45,105],"single":[47,52],"reversely":[50],"large":[53],"can":[55],"be":[56],"iteratively":[57],"divided":[58],"into":[59],"smaller":[60],"clusters.":[61],"There":[62,126],"two":[64,77],"types":[65,78,129],"hierarchical":[67],"clustering:":[68],"agglomerative":[69],"clustering;":[70],"and":[71,84,150],"divisive":[72],"clustering.":[73,86],"Basically,":[74],"there":[75],"clustering,":[80],"namely,":[81],"hard":[82,91],"soft":[85],"The":[87],"K-means":[88],"algorithm":[89],"performs":[90],"clustering\u2014the":[92],"points":[94,121],"assigned":[96],"only":[98],"one":[99],"their":[103],"distances":[104],"centroid":[107],"cluster.":[110],"Representative-based":[111],"given":[115],"set":[117],"with":[118],"n":[119],"an":[123],"N-dimensional":[124],"space.":[125],"three":[128],"outlier":[131,145,148,152],"detection":[132],"availability":[137],"training":[139],"set.":[141],"They":[142],"are:":[143],"supervised":[144],"detection;":[146,149],"semi-supervised":[147],"unsupervised":[151],"detection.":[153]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2022-05-12T00:00:00"}