{"id":"https://openalex.org/W1976273795","doi":"https://doi.org/10.1109/dbta.2010.5659055","title":"Research on Text Clustering Algorithms","display_name":"Research on Text Clustering Algorithms","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W1976273795","doi":"https://doi.org/10.1109/dbta.2010.5659055","mag":"1976273795"},"language":"en","primary_location":{"id":"doi:10.1109/dbta.2010.5659055","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dbta.2010.5659055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 2nd International Workshop on Database Technology and Applications","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/A5100426184","display_name":"Qun Li","orcid":"https://orcid.org/0000-0003-2231-6615"},"institutions":[{"id":"https://openalex.org/I31683504","display_name":"Beijing Forestry University","ror":"https://ror.org/04xv2pc41","country_code":"CN","type":"education","lineage":["https://openalex.org/I1327237609","https://openalex.org/I31683504","https://openalex.org/I4210127390"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Qun Li","raw_affiliation_strings":["Sch. of Inf. Sci. &Technol., Beijing Forestry Univ., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Sch. of Inf. Sci. &Technol., Beijing Forestry Univ., Beijing, China","institution_ids":["https://openalex.org/I31683504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077676247","display_name":"Xinyuan Huang","orcid":"https://orcid.org/0000-0002-5787-381X"},"institutions":[{"id":"https://openalex.org/I31683504","display_name":"Beijing Forestry University","ror":"https://ror.org/04xv2pc41","country_code":"CN","type":"education","lineage":["https://openalex.org/I1327237609","https://openalex.org/I31683504","https://openalex.org/I4210127390"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinyuan Huang","raw_affiliation_strings":["Sch. of Inf. Sci. &Technol., Beijing Forestry Univ., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Sch. of Inf. Sci. &Technol., Beijing Forestry Univ., Beijing, China","institution_ids":["https://openalex.org/I31683504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100426184"],"corresponding_institution_ids":["https://openalex.org/I31683504"],"apc_list":null,"apc_paid":null,"fwci":0.3372,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.53232186,"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":"1","last_page":"3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9970999956130981,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9962000250816345,"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.9932000041007996,"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/dbscan","display_name":"DBSCAN","score":0.9063421487808228},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8041224479675293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7725138664245605},{"id":"https://openalex.org/keywords/medoid","display_name":"Medoid","score":0.6285879611968994},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5513177514076233},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.49887514114379883},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4890021085739136},{"id":"https://openalex.org/keywords/k-medoids","display_name":"k-medoids","score":0.4649570882320404},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4479696452617645},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4350113272666931},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.42879951000213623},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.4192095100879669},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.3916701674461365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38046714663505554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3576996326446533},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14783596992492676}],"concepts":[{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.9063421487808228},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8041224479675293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7725138664245605},{"id":"https://openalex.org/C63085389","wikidata":"https://www.wikidata.org/wiki/Q4287912","display_name":"Medoid","level":3,"score":0.6285879611968994},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5513177514076233},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.49887514114379883},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4890021085739136},{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"score":0.4649570882320404},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4479696452617645},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4350113272666931},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.42879951000213623},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.4192095100879669},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3916701674461365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38046714663505554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3576996326446533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14783596992492676},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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.1109/dbta.2010.5659055","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dbta.2010.5659055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 2nd International Workshop on Database Technology and Applications","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":7,"referenced_works":["https://openalex.org/W1673310716","https://openalex.org/W2066680326","https://openalex.org/W2147794039","https://openalex.org/W2183847413","https://openalex.org/W4247105055","https://openalex.org/W6637131181","https://openalex.org/W6681658666"],"related_works":["https://openalex.org/W3133849001","https://openalex.org/W1481798977","https://openalex.org/W2380053301","https://openalex.org/W4225615903","https://openalex.org/W2162403615","https://openalex.org/W2088480663","https://openalex.org/W2967990367","https://openalex.org/W1976273795","https://openalex.org/W2911682185","https://openalex.org/W2799087180"],"abstract_inverted_index":{"Web":[0],"documents":[1,10],"are":[2],"enormous.":[3],"Text":[4],"clustering":[5,44,52],"is":[6,68],"to":[7,70],"place":[8],"the":[9,12,18,22,28,66,71,76],"with":[11],"most":[13],"words":[14],"in":[15],"common":[16],"into":[17],"same":[19],"cluster.":[20],"Thus":[21],"web":[23],"search":[24],"engine":[25],"can":[26],"structure":[27],"large":[29],"result":[30],"set":[31],"for":[32],"a":[33,79],"certain":[34],"quest.":[35],"In":[36],"this":[37],"article,":[38],"we":[39],"study":[40],"three":[41],"kinds":[42],"of":[43],"algorithms,":[45,58],"prototype":[46],"based,":[47],"density":[48],"based":[49],"and":[50,60,75],"hierarchical":[51],"algorithms.":[53],"We":[54],"compare":[55],"two":[56],"typical":[57],"K-medoids":[59,67],"DBSCAN.":[61],"The":[62],"results":[63],"show":[64],"that":[65],"sensitive":[69],"initial":[72],"center":[73],"point":[74],"DBSCAN":[77],"has":[78],"better":[80],"performance.":[81]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}