{"id":"https://openalex.org/W2069947582","doi":"https://doi.org/10.1109/icsdm.2011.5969100","title":"Comparing two density-based clustering methods for reducing very large spatio-temporal dataset","display_name":"Comparing two density-based clustering methods for reducing very large spatio-temporal dataset","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2069947582","doi":"https://doi.org/10.1109/icsdm.2011.5969100","mag":"2069947582"},"language":"en","primary_location":{"id":"doi:10.1109/icsdm.2011.5969100","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsdm.2011.5969100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2011 IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services","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/A5056825882","display_name":"Michael Whelan","orcid":"https://orcid.org/0000-0003-1530-4528"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Michael Whelan","raw_affiliation_strings":["School of Computer Science and Informatics, University College Dublin, Dublin, Ireland","School of Computer Science and Informatics University College Dublin Belfield Dublin 4 Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Informatics, University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]},{"raw_affiliation_string":"School of Computer Science and Informatics University College Dublin Belfield Dublin 4 Ireland","institution_ids":["https://openalex.org/I100930933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073189627","display_name":"Nhien\u2010An Le\u2010Khac","orcid":"https://orcid.org/0000-0003-4373-2212"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Nhien-An Le-Khac","raw_affiliation_strings":["School of Computer Science and Informatics, University College Dublin, Dublin, Ireland","School of Computer Science and Informatics University College Dublin Belfield Dublin 4 Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Informatics, University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]},{"raw_affiliation_string":"School of Computer Science and Informatics University College Dublin Belfield Dublin 4 Ireland","institution_ids":["https://openalex.org/I100930933"]}]},{"author_position":"last","author":{"id":null,"display_name":"M-Tahar Kechadi","orcid":null},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"M-Tahar Kechadi","raw_affiliation_strings":["School of Computer Science and Informatics, University College Dublin, Dublin, Ireland","School of Computer Science and Informatics University College Dublin Belfield Dublin 4 Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Informatics, University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]},{"raw_affiliation_string":"School of Computer Science and Informatics University College Dublin Belfield Dublin 4 Ireland","institution_ids":["https://openalex.org/I100930933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100930933"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"519","last_page":"524"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9991000294685364,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9959999918937683,"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.9921000003814697,"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.7601538896560669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7260642051696777},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6489503383636475},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.6105775237083435},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4921952784061432},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.4628227651119232},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4599882662296295},{"id":"https://openalex.org/keywords/consensus-clustering","display_name":"Consensus clustering","score":0.45830559730529785},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4427388608455658},{"id":"https://openalex.org/keywords/raw-data","display_name":"Raw data","score":0.4219076633453369},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4186003804206848},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4138734042644501},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.36495503783226013},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.2794913351535797},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.13712570071220398},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08902943134307861}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7601538896560669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7260642051696777},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6489503383636475},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6105775237083435},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4921952784061432},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.4628227651119232},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4599882662296295},{"id":"https://openalex.org/C186767784","wikidata":"https://www.wikidata.org/wiki/Q5162841","display_name":"Consensus clustering","level":5,"score":0.45830559730529785},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4427388608455658},{"id":"https://openalex.org/C132964779","wikidata":"https://www.wikidata.org/wiki/Q2110223","display_name":"Raw data","level":2,"score":0.4219076633453369},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4186003804206848},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4138734042644501},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.36495503783226013},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.2794913351535797},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.13712570071220398},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08902943134307861},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/icsdm.2011.5969100","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsdm.2011.5969100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2011 IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W8190784","https://openalex.org/W30346873","https://openalex.org/W42802941","https://openalex.org/W80917968","https://openalex.org/W1525417996","https://openalex.org/W1560079542","https://openalex.org/W1565377632","https://openalex.org/W1588594383","https://openalex.org/W1596290048","https://openalex.org/W1673310716","https://openalex.org/W1992764659","https://openalex.org/W2003022898","https://openalex.org/W2078442433","https://openalex.org/W2089923519","https://openalex.org/W2122496402","https://openalex.org/W2158321245","https://openalex.org/W2514509446","https://openalex.org/W4205774955","https://openalex.org/W6631562884","https://openalex.org/W6637131181"],"related_works":["https://openalex.org/W2990663423","https://openalex.org/W3171568022","https://openalex.org/W2097149198","https://openalex.org/W2023878529","https://openalex.org/W2978680959","https://openalex.org/W4390606637","https://openalex.org/W260640599","https://openalex.org/W3123857158","https://openalex.org/W3049072127","https://openalex.org/W3113374561"],"abstract_inverted_index":{"Cluster-based":[0],"mining":[1],"methods":[2,29],"have":[3],"proven":[4],"to":[5,26,33,66,69,122],"be":[6,31],"a":[7,49,55],"successful":[8],"method":[9],"for":[10,84,135],"the":[11,35,94,107,113,117,124],"reduction":[12],"of":[13,38,52,58,96],"very":[14,22],"large":[15,23,36,56,86],"spatio-temporal":[16,87],"datasets.":[17,88],"These":[18],"datasets":[19],"are":[20,91],"often":[21],"and":[24,98,112,131],"difficult":[25],"analyse.":[27],"Clustering":[28],"can":[30,62],"used":[32],"decrease":[34],"size":[37,57],"original":[39],"data":[40],"by":[41],"retrieving":[42],"its":[43],"useful":[44],"knowledge":[45],"as":[46],"representatives.":[47],"As":[48],"consequence,":[50],"instead":[51],"dealing":[53],"with":[54],"raw":[59],"data,":[60],"we":[61,78],"use":[63],"these":[64],"representatives":[65],"visualise":[67],"or":[68],"analyse":[70],"without":[71],"losing":[72],"important":[73],"information.":[74],"In":[75],"this":[76,136],"paper,":[77],"compare":[79],"our":[80],"two":[81],"clustering-based":[82],"approaches":[83,90],"reducing":[85],"Both":[89],"based":[92],"on":[93],"combination":[95],"density-based":[97],"graph-based":[99],"clustering.":[100],"The":[101],"first":[102],"one":[103,115],"takes":[104],"into":[105],"account":[106],"Shared":[108],"Nearest":[109],"Neighbour":[110],"degree":[111],"second":[114],"applies":[116],"Euclidean":[118],"metric":[119],"distance":[120],"radius":[121],"determine":[123],"nearest":[125],"neighbour":[126],"similarity.":[127],"We":[128],"also":[129],"present":[130],"discuss":[132],"preliminary":[133],"results":[134],"comparison.":[137]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}