{"id":"https://openalex.org/W2338150351","doi":null,"title":"An Efficient Density Based Incremental Clustering Algorithm in Data Warehousing Environment","display_name":"An Efficient Density Based Incremental Clustering Algorithm in Data Warehousing Environment","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2338150351","mag":"2338150351"},"language":"en","primary_location":{"id":"mag:2338150351","doi":null,"is_oa":false,"landing_page_url":"http://ipcsit.com/vol2/90-C136.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5053105431","display_name":"Navneet Goyal","orcid":"https://orcid.org/0000-0002-0006-8211","observed_orcids":["https://orcid.org/0000-0002-0006-8211"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Navneet Goyal","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-0006-8211","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013239123","display_name":"K. Venkatramaiah","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. Venkatramaiah","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113740386","display_name":"P Deepak","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P Deepak","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":0.9522,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.77210831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9887999892234802,"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.9887999892234802,"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.009100000374019146,"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.0003000000142492354,"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/incremental-clustering","display_name":"incremental clustering","score":0.9800000190734863},{"id":"https://openalex.org/keywords/density-based-clustering","display_name":"density-based clustering","score":0.9760000109672546},{"id":"https://openalex.org/keywords/dbscan","display_name":"DBSCAN","score":0.9900000095367432},{"id":"https://openalex.org/keywords/data-warehouse","display_name":"data warehouse","score":0.6539999842643738},{"id":"https://openalex.org/keywords/cluster-mergers","display_name":"cluster mergers","score":0.7490000128746033},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.8880000114440918},{"id":"https://openalex.org/keywords/multidimensional-data","display_name":"multidimensional data","score":0.6779999732971191},{"id":"https://openalex.org/keywords/region-queries","display_name":"region queries","score":0.6769999861717224}],"concepts":[{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.9026908874511719},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7872155904769897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7765787839889526},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.7209196090698242},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5315342545509338},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5077327489852905},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.49467822909355164},{"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.4856671094894409},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.4764683246612549},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.45937976241111755},{"id":"https://openalex.org/C135572916","wikidata":"https://www.wikidata.org/wiki/Q193351","display_name":"Data warehouse","level":2,"score":0.4470342695713043},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.42389583587646484},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.34169578552246094},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15469786524772644},{"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":"mag:2338150351","doi":null,"is_oa":false,"landing_page_url":"http://ipcsit.com/vol2/90-C136.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W11451522","https://openalex.org/W1480706567","https://openalex.org/W1489108128","https://openalex.org/W1530595269","https://openalex.org/W1573724273","https://openalex.org/W1673310716","https://openalex.org/W1831768459","https://openalex.org/W2011797273","https://openalex.org/W2022902860","https://openalex.org/W2073308541","https://openalex.org/W2080068757","https://openalex.org/W2114624736","https://openalex.org/W2122868074","https://openalex.org/W2132821110","https://openalex.org/W2141290019","https://openalex.org/W2145197749","https://openalex.org/W2151135734","https://openalex.org/W2151779484","https://openalex.org/W2158462786","https://openalex.org/W2169581671","https://openalex.org/W2170936641","https://openalex.org/W2999729612"],"related_works":["https://openalex.org/W1530595269","https://openalex.org/W2237809932","https://openalex.org/W2388515406","https://openalex.org/W2950903130","https://openalex.org/W2111843750","https://openalex.org/W2355621680","https://openalex.org/W2284843338","https://openalex.org/W2753744934","https://openalex.org/W2378284627","https://openalex.org/W2314747987"],"abstract_inverted_index":{"Data":[0],"Warehouses":[1],"are":[2,41,102,114,234],"a":[3,76],"good":[4],"source":[5],"of":[6,25,82,90,126,177,181,195,219,224],"data":[7,10,14,17,26,29,38,66,97,164,170,198],"for":[8],"downstream":[9],"mining":[11,39],"applications.":[12],"New":[13],"arrives":[15],"in":[16,64,85,222],"warehouses":[18],"during":[19],"the":[20,96,106,123,132,144,150,163,168,178,182,192,196,201,209,238],"periodic":[21],"refresh":[22],"cycles.":[23],"Appending":[24],"on":[27],"existing":[28,61,71,88,117,202],"requires":[30],"that":[31,143,171,186],"all":[32],"patterns":[33,194],"discovered":[34],"earlier":[35],"using":[36,105],"various":[37],"algorithms":[40],"updated":[42],"with":[43,116,122,200],"each":[44],"refresh.":[45],"In":[46,92],"this":[47,93],"paper,":[48],"we":[49,130,172,206],"present":[50],"an":[51,60],"incremental":[52,62,146,231],"density":[53],"based":[54],"clustering":[55,147,193,203],"algorithm.":[56],"Incremental":[57,156],"DBSCAN":[58,107],"is":[59,80,141,185,217],"algorithm":[63,79,108,148,216],"which":[65],"can":[67,207],"be":[68,100],"added/deleted":[69],"to/from":[70],"clusters,":[72,118],"one":[73],"point":[74],"at":[75],"time.":[77],"Our":[78],"capable":[81,218],"adding":[83,137],"points":[84,98,138],"bulk":[86],"to":[87,99,119,166,174,190,230,236],"set":[89,125],"clusters.":[91,127],"new":[94,112,197],"algorithm,":[95],"added":[101],"first":[103],"clustered":[104],"and":[109],"then":[110],"these":[111],"clusters":[113,133,152,211],"merged":[115,210],"come":[120],"up":[121],"modified":[124],"That":[128],"is,":[129],"add":[131],"incrementally":[134],"rather":[135],"than":[136],"incrementally.":[139],"It":[140],"found":[142],"proposed":[145,183,215],"produces":[149],"same":[151],"as":[153,162,212,228],"obtained":[154],"by":[155],"DBSCAN.":[157,232],"We":[158],"have":[159],"used":[160],"R*-trees":[161],"structure":[165],"hold":[167],"multidimensional":[169],"need":[173],"cluster.":[175],"One":[176],"major":[179],"advantages":[180],"approach":[184],"it":[187],"allows":[188],"us":[189],"see":[191,208],"along":[199],"patterns.":[204],"Moreover,":[205],"well.":[213],"The":[214],"considerable":[220],"savings,":[221],"terms":[223],"region":[225],"queries":[226],"performed,":[227],"compared":[229],"Results":[233],"presented":[235],"support":[237],"claim.":[239]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}