{"id":"https://openalex.org/W2165336231","doi":"https://doi.org/10.1109/icdm.2008.116","title":"HIREL: An Incremental Clustering Algorithm for Relational Datasets","display_name":"HIREL: An Incremental Clustering Algorithm for Relational Datasets","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2165336231","doi":"https://doi.org/10.1109/icdm.2008.116","mag":"2165336231"},"language":"en","primary_location":{"id":"doi:10.1109/icdm.2008.116","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2008.116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 Eighth IEEE International Conference on Data Mining","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/A5100455386","display_name":"Tao Li","orcid":"https://orcid.org/0000-0003-3113-6835"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tao Li","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113675681","display_name":"Sarabjot Singh Anand","orcid":null},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sarabjot S. Anand","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":1.7626,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86019149,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"887","last_page":"892"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9984999895095825,"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/T11106","display_name":"Data Management and Algorithms","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8167190551757812},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.786584734916687},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5786253809928894},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5717159509658813},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5404707789421082},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5289663672447205},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.5166216492652893},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.44878318905830383},{"id":"https://openalex.org/keywords/conceptual-clustering","display_name":"Conceptual clustering","score":0.440944105386734},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3875352740287781},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.366943895816803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34278056025505066}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8167190551757812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.786584734916687},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5786253809928894},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5717159509658813},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5404707789421082},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5289663672447205},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.5166216492652893},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.44878318905830383},{"id":"https://openalex.org/C39235581","wikidata":"https://www.wikidata.org/wiki/Q5158434","display_name":"Conceptual clustering","level":5,"score":0.440944105386734},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3875352740287781},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.366943895816803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34278056025505066}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icdm.2008.116","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2008.116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 Eighth IEEE International Conference on Data Mining","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.374.3312","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.3312","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.dcs.warwick.ac.uk/612/1/hirel.pdf","raw_type":"text"}],"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/W11451522","https://openalex.org/W1516980465","https://openalex.org/W1530595269","https://openalex.org/W1543387779","https://openalex.org/W1992419399","https://openalex.org/W2095897464","https://openalex.org/W2101977550","https://openalex.org/W2119282764","https://openalex.org/W2121906195","https://openalex.org/W2158462786","https://openalex.org/W2913066018","https://openalex.org/W2978337448","https://openalex.org/W3149838063","https://openalex.org/W4206727053","https://openalex.org/W4231029117","https://openalex.org/W4234562309","https://openalex.org/W4252521233","https://openalex.org/W6600456855","https://openalex.org/W6631782964","https://openalex.org/W6698813454","https://openalex.org/W6990529770"],"related_works":["https://openalex.org/W2160785859","https://openalex.org/W3146523624","https://openalex.org/W2390610678","https://openalex.org/W2622412490","https://openalex.org/W2188840951","https://openalex.org/W2897883632","https://openalex.org/W2407786351","https://openalex.org/W2241871771","https://openalex.org/W3140018618","https://openalex.org/W2607137685"],"abstract_inverted_index":{"Traditional":[0],"clustering":[1,61,69,90],"approaches":[2,62],"usually":[3],"analyze":[4],"static":[5],"datasets":[6,19,76],"in":[7],"which":[8,23],"objects":[9],"are":[10,20,71],"kept":[11],"unchanged":[12],"after":[13],"being":[14],"processed,":[15],"but":[16],"many":[17],"practical":[18],"dynamically":[21],"modified":[22],"means":[24],"some":[25],"previously":[26],"learned":[27],"patterns":[28],"have":[29],"to":[30,46],"be":[31],"updated":[32],"accordingly.":[33],"Re-clustering":[34],"the":[35,47,52,57,98,104,108,114,120],"whole":[36],"dataset":[37],"from":[38],"scratch":[39],"is":[40,63],"not":[41,72],"a":[42],"good":[43],"choice":[44],"due":[45],"frequent":[48],"data":[49],"modifications":[50],"and":[51,107],"limited":[53],"out-of-service":[54],"time,":[55],"so":[56],"development":[58],"of":[59,78,97,103,122],"incremental":[60,89],"highly":[64],"desirable.":[65],"Besides":[66],"that,":[67],"propositional":[68],"algorithms":[70],"suitable":[73],"for":[74],"relational":[75,99],"because":[77],"their":[79],"quadratic":[80],"computational":[81],"complexity.":[82],"In":[83],"this":[84],"paper,":[85],"we":[86],"propose":[87],"an":[88],"algorithm":[91],"that":[92],"requires":[93],"only":[94],"one":[95],"pass":[96],"dataset.":[100],"The":[101],"utilization":[102],"Representative":[105],"Objects":[106],"balanced":[109],"Search":[110],"Tree":[111],"greatly":[112],"accelerate":[113],"learning":[115],"procedure.":[116],"Experimental":[117],"results":[118],"prove":[119],"effectiveness":[121],"our":[123],"algorithm.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}