{"id":"https://openalex.org/W2065695353","doi":"https://doi.org/10.1109/iri.2010.5558969","title":"Heuristic based approach to clustering and its time critical applications","display_name":"Heuristic based approach to clustering and its time critical applications","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2065695353","doi":"https://doi.org/10.1109/iri.2010.5558969","mag":"2065695353"},"language":"en","primary_location":{"id":"doi:10.1109/iri.2010.5558969","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri.2010.5558969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Information Reuse & Integration","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/A5088779050","display_name":"Alan Chia-Lung Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alan Chia-Lung Chen","raw_affiliation_strings":["Department of Computer Science, University of Calgary, Calgary, AB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calgary, Calgary, AB, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101458036","display_name":"Shang Gao","orcid":"https://orcid.org/0000-0002-1595-3176"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Shang Gao","raw_affiliation_strings":["Department of Computer Science, University of Calgary, Calgary, AB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calgary, Calgary, AB, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066265052","display_name":"Reda Alhajj","orcid":"https://orcid.org/0000-0001-6657-9738"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]},{"id":"https://openalex.org/I904090387","display_name":"Global University","ror":"https://ror.org/04frhb927","country_code":"LB","type":"education","lineage":["https://openalex.org/I904090387"]}],"countries":["CA","LB"],"is_corresponding":false,"raw_author_name":"Reda Alhajj","raw_affiliation_strings":["Department of Computer Science, Global University, Beirut, Lebanon","Department of Computer Science, University of Calgary, Calgary, AB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Global University, Beirut, Lebanon","institution_ids":["https://openalex.org/I904090387"]},{"raw_affiliation_string":"Department of Computer Science, University of Calgary, Calgary, AB, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034281379","display_name":"Panagiotis Karampelas","orcid":"https://orcid.org/0000-0003-1684-7612"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Panagiotis Karampelas","raw_affiliation_strings":["Department of Information Technology, Hellenic American University, Athens, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Hellenic American University, Athens, Greece","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17791912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"37","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8593859076499939},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7434711456298828},{"id":"https://openalex.org/keywords/dbscan","display_name":"DBSCAN","score":0.7041509747505188},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5615813732147217},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.5055396556854248},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4976663887500763},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.42068326473236084},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4173767566680908},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3649037778377533},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.19079071283340454},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1890236735343933}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8593859076499939},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7434711456298828},{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.7041509747505188},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5615813732147217},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.5055396556854248},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4976663887500763},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.42068326473236084},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4173767566680908},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3649037778377533},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.19079071283340454},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1890236735343933}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iri.2010.5558969","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri.2010.5558969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Information Reuse & Integration","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":12,"referenced_works":["https://openalex.org/W1673310716","https://openalex.org/W1997970277","https://openalex.org/W2035890032","https://openalex.org/W2094191210","https://openalex.org/W2095897464","https://openalex.org/W2127218421","https://openalex.org/W2146648681","https://openalex.org/W2571961927","https://openalex.org/W4231029117","https://openalex.org/W6637131181","https://openalex.org/W6678914141","https://openalex.org/W6820729558"],"related_works":["https://openalex.org/W2394193399","https://openalex.org/W2054669762","https://openalex.org/W2387373525","https://openalex.org/W2809859387","https://openalex.org/W2353158678","https://openalex.org/W2377732725","https://openalex.org/W2384052049","https://openalex.org/W2367205823","https://openalex.org/W2087424554","https://openalex.org/W2131625050"],"abstract_inverted_index":{"Clustering":[0],"may":[1],"be":[2],"named":[3],"as":[4,17,153,186],"the":[5,11,39,78,90,101,119,143,151,154,175],"first":[6],"clustering":[7,34,53],"technique":[8,50,71,114,159,177],"addressed":[9],"by":[10,166],"research":[12,25],"community":[13],"since":[14],"1960s.":[15],"However,":[16],"databases":[18,187],"continue":[19],"to":[20,30,37,52,58,103,118,149],"grow":[21,188],"in":[22],"size,":[23],"numerous":[24],"studies":[26],"have":[27],"been":[28,116],"undertaken":[29],"develop":[31],"more":[32,106,183,185],"efficient":[33],"algorithms":[35,54,127,135],"and":[36,61,85,99,125,142,184,190],"improve":[38],"performance":[40],"of":[41],"existing":[42],"ones.":[43],"This":[44],"paper":[45],"demonstrates":[46],"a":[47,56,73,105,167],"general":[48],"optimization":[49,70,113,138,158,176],"applicable":[51],"with":[55,128,136],"need":[57,102],"calculate":[59],"distances":[60],"check":[62],"them":[63],"against":[64,89],"some":[65],"minimum":[66,79,91],"distance":[67,81,88,92,108],"condition.":[68],"The":[69,111,157],"is":[72],"simple":[74],"calculation":[75],"that":[76],"finds":[77],"possible":[80],"between":[82],"two":[83],"points,":[84],"checks":[86],"this":[87,137],"condition;":[93],"thus":[94],"reusing":[95],"already":[96],"computed":[97],"values":[98],"reducing":[100,164,181],"compute":[104],"complicated":[107],"function":[109],"periodically.":[110],"proposed":[112],"has":[115],"applied":[117],"agglomerative":[120],"hierarchical":[121],"clustering,":[122,124],"k-means":[123],"DBSCAN":[126],"successful":[129],"results.":[130],"Runtimes":[131],"for":[132,163,170,180],"all":[133],"three":[134],"scenario":[139],"were":[140,147],"reduced,":[141],"clusters":[144],"they":[145],"returned":[146],"verified":[148],"remain":[150],"same":[152],"original":[155],"algorithms.":[156],"also":[160],"shows":[161,178],"potential":[162,179],"runtimes":[165,182],"substantial":[168],"amount":[169],"large":[171],"databases.":[172],"As":[173],"well,":[174],"larger":[189],"larger.":[191]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}