{"id":"https://openalex.org/W3007112080","doi":"https://doi.org/10.1109/imcom48794.2020.9001738","title":"A Farthest First Traversal based Sampling Algorithm for k-clustering","display_name":"A Farthest First Traversal based Sampling Algorithm for k-clustering","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3007112080","doi":"https://doi.org/10.1109/imcom48794.2020.9001738","mag":"3007112080"},"language":"en","primary_location":{"id":"doi:10.1109/imcom48794.2020.9001738","is_oa":false,"landing_page_url":"https://doi.org/10.1109/imcom48794.2020.9001738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 14th International Conference on Ubiquitous Information Management and Communication (IMCOM)","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/A5071064677","display_name":"Le Hong Trang","orcid":"https://orcid.org/0000-0002-6011-2261"},"institutions":[{"id":"https://openalex.org/I123565023","display_name":"Vietnam National University Ho Chi Minh City","ror":"https://ror.org/00waaqh38","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Le Hong Trang","raw_affiliation_strings":["HCMC University of Technology Vietnam National University, HCMC, HCMC, Vietnam"],"affiliations":[{"raw_affiliation_string":"HCMC University of Technology Vietnam National University, HCMC, HCMC, Vietnam","institution_ids":["https://openalex.org/I123565023"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084146876","display_name":"Nguyen Le Hoang","orcid":"https://orcid.org/0000-0002-3351-8960"},"institutions":[{"id":"https://openalex.org/I123565023","display_name":"Vietnam National University Ho Chi Minh City","ror":"https://ror.org/00waaqh38","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen Le Hoang","raw_affiliation_strings":["HCMC University of Technology Vietnam National University, HCMC, HCMC, Vietnam"],"affiliations":[{"raw_affiliation_string":"HCMC University of Technology Vietnam National University, HCMC, HCMC, Vietnam","institution_ids":["https://openalex.org/I123565023"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029072011","display_name":"Tran Khanh Dang","orcid":"https://orcid.org/0000-0002-7282-3589"},"institutions":[{"id":"https://openalex.org/I123565023","display_name":"Vietnam National University Ho Chi Minh City","ror":"https://ror.org/00waaqh38","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tran Khanh Dang","raw_affiliation_strings":["HCMC University of Technology Vietnam National University, HCMC, HCMC, Vietnam"],"affiliations":[{"raw_affiliation_string":"HCMC University of Technology Vietnam National University, HCMC, HCMC, Vietnam","institution_ids":["https://openalex.org/I123565023"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071064677"],"corresponding_institution_ids":["https://openalex.org/I123565023"],"apc_list":null,"apc_paid":null,"fwci":1.3256,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84345384,"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":"6"},"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.9987000226974487,"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/T10057","display_name":"Face and Expression Recognition","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/tree-traversal","display_name":"Tree traversal","score":0.7823941707611084},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7429467439651489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6984294652938843},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.6927763819694519},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6412771344184875},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5583403706550598},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.5570802092552185},{"id":"https://openalex.org/keywords/adaptive-sampling","display_name":"Adaptive sampling","score":0.5068262219429016},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.4471130073070526},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4356808662414551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22810429334640503},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20621150732040405},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.10232222080230713},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0625070333480835}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7823941707611084},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7429467439651489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6984294652938843},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.6927763819694519},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6412771344184875},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5583403706550598},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.5570802092552185},{"id":"https://openalex.org/C2781395549","wikidata":"https://www.wikidata.org/wiki/Q4680762","display_name":"Adaptive sampling","level":3,"score":0.5068262219429016},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.4471130073070526},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4356808662414551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22810429334640503},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20621150732040405},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.10232222080230713},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0625070333480835},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"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/imcom48794.2020.9001738","is_oa":false,"landing_page_url":"https://doi.org/10.1109/imcom48794.2020.9001738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 14th International Conference on Ubiquitous Information Management and Communication (IMCOM)","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":34,"referenced_works":["https://openalex.org/W596522316","https://openalex.org/W1578468649","https://openalex.org/W1970866964","https://openalex.org/W1973264045","https://openalex.org/W1977983731","https://openalex.org/W1981313592","https://openalex.org/W1998905999","https://openalex.org/W2022179164","https://openalex.org/W2033403400","https://openalex.org/W2045964207","https://openalex.org/W2073459066","https://openalex.org/W2091283109","https://openalex.org/W2091684877","https://openalex.org/W2146200992","https://openalex.org/W2150593711","https://openalex.org/W2165142526","https://openalex.org/W2247953682","https://openalex.org/W2298388144","https://openalex.org/W2345217624","https://openalex.org/W2593346713","https://openalex.org/W2795091454","https://openalex.org/W2898466795","https://openalex.org/W2924550458","https://openalex.org/W2956015669","https://openalex.org/W2956142964","https://openalex.org/W2967420254","https://openalex.org/W2989728029","https://openalex.org/W4235169531","https://openalex.org/W4238136308","https://openalex.org/W4244030505","https://openalex.org/W6668990524","https://openalex.org/W6681580871","https://openalex.org/W6690901460","https://openalex.org/W6734388564"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W1587123803","https://openalex.org/W2128075414","https://openalex.org/W4301044568","https://openalex.org/W2952867832","https://openalex.org/W2571039174"],"abstract_inverted_index":{"The":[0,76],"farthest-first-traversal":[1],"(fft)":[2],"algorithm":[3,22,40,67,77,93],"originally":[4],"was":[5],"used":[6],"by":[7,42,94],"Rosenkrantz":[8],"et":[9],"al.":[10],"in":[11,80],"an":[12,74],"analysis":[13],"of":[14,38,71],"heuristics":[15],"for":[16,27,54,57,86],"the":[17,51,69,81,92,97,105],"traveling":[18],"salesman":[19],"problem.":[20],"This":[21],"has":[23],"been":[24],"extensively":[25],"studied":[26],"several":[28],"sampling":[29,55,99],"techniques.":[30],"In":[31],"this":[32],"work,":[33],"we":[34],"present":[35],"a":[36],"modification":[37],"ProTraS":[39],"given":[41],"Ros":[43],"and":[44,60,84,100],"Guillaume,":[45],"which":[46],"is":[47,78],"also":[48,90],"based":[49],"on":[50],"fft":[52],"algorithm,":[53],"datasets":[56],"both":[58],"k-means":[59],"k-median":[61],"clustering":[62],"algorithms.":[63],"Unlike":[64],"ProTraS,":[65],"proposed":[66],"takes":[68],"size":[70],"samples":[72],"as":[73],"input.":[75],"implemented":[79],"Spark":[82],"platform":[83],"tested":[85],"benchmark":[87],"datasets.":[88],"We":[89],"estimate":[91],"comparing":[95],"with":[96],"adaptive":[98],"lightweight":[101],"coreset":[102],"algorithms,":[103],"using":[104],"adjust":[106],"Rand":[107],"index.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}