{"id":"https://openalex.org/W2602996773","doi":"https://doi.org/10.1109/istel.2016.7881807","title":"A new density estimator based on nearest and farthest neighbor","display_name":"A new density estimator based on nearest and farthest neighbor","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2602996773","doi":"https://doi.org/10.1109/istel.2016.7881807","mag":"2602996773"},"language":"en","primary_location":{"id":"doi:10.1109/istel.2016.7881807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istel.2016.7881807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Symposium on Telecommunications (IST)","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/A5019477068","display_name":"Azadeh Faroughi","orcid":"https://orcid.org/0000-0002-9945-8075"},"institutions":[{"id":"https://openalex.org/I204490172","display_name":"Shiraz University of Technology","ror":"https://ror.org/04bxa3v83","country_code":"IR","type":"education","lineage":["https://openalex.org/I204490172"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Azadeh Faroughi","raw_affiliation_strings":["PhD Student in Computer Engineering and IT Department Shiraz University of Technology, Shiraz, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PhD Student in Computer Engineering and IT Department Shiraz University of Technology, Shiraz, Iran","institution_ids":["https://openalex.org/I204490172"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058428827","display_name":"Reza Javidan","orcid":"https://orcid.org/0000-0002-7788-6597"},"institutions":[{"id":"https://openalex.org/I204490172","display_name":"Shiraz University of Technology","ror":"https://ror.org/04bxa3v83","country_code":"IR","type":"education","lineage":["https://openalex.org/I204490172"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Reza Javidan","raw_affiliation_strings":["Assistant Professor in Computer Engineering and IT Department Shiraz University of Technology, Shiraz, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Assistant Professor in Computer Engineering and IT Department Shiraz University of Technology, Shiraz, Iran","institution_ids":["https://openalex.org/I204490172"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030153279","display_name":"Mohsen Emami","orcid":"https://orcid.org/0000-0001-9515-2338"},"institutions":[{"id":"https://openalex.org/I55547365","display_name":"Payame Noor University","ror":"https://ror.org/031699d98","country_code":"IR","type":"education","lineage":["https://openalex.org/I55547365"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohsen Emami","raw_affiliation_strings":["Lecturer in Computer Engineering and IT Department Payame Noor University, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lecturer in Computer Engineering and IT Department Payame Noor University, Tehran, Iran","institution_ids":["https://openalex.org/I55547365"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7324,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.89915331,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9991999864578247,"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.9991999864578247,"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/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.9970999956130981,"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.9945999979972839,"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/dbscan","display_name":"DBSCAN","score":0.7229241132736206},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.6829056739807129},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6221002340316772},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6158238649368286},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6060271859169006},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6020090579986572},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5816976428031921},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5287256836891174},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.49434351921081543},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4693380892276764},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4378746747970581},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42457765340805054},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.356581449508667},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.33922046422958374},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3381189703941345},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26622462272644043},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11779463291168213},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.11640128493309021},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.11374154686927795}],"concepts":[{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.7229241132736206},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.6829056739807129},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6221002340316772},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6158238649368286},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6060271859169006},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6020090579986572},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5816976428031921},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5287256836891174},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.49434351921081543},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4693380892276764},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4378746747970581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42457765340805054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.356581449508667},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.33922046422958374},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3381189703941345},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26622462272644043},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11779463291168213},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.11640128493309021},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.11374154686927795},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istel.2016.7881807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istel.2016.7881807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Symposium on Telecommunications (IST)","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":21,"referenced_works":["https://openalex.org/W106621143","https://openalex.org/W1978598160","https://openalex.org/W1987073347","https://openalex.org/W2020841906","https://openalex.org/W2027902860","https://openalex.org/W2050913223","https://openalex.org/W2063155970","https://openalex.org/W2079247126","https://openalex.org/W2094050146","https://openalex.org/W2115381060","https://openalex.org/W2119309681","https://openalex.org/W2126626732","https://openalex.org/W2131687179","https://openalex.org/W2133296809","https://openalex.org/W2141585940","https://openalex.org/W2169889617","https://openalex.org/W2480429758","https://openalex.org/W3120740533","https://openalex.org/W3146790959","https://openalex.org/W4238722012","https://openalex.org/W4254182148"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W1949910768","https://openalex.org/W2085998272","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758"],"abstract_inverted_index":{"Usually":[0],"nearest-neighbor":[1],"density":[2,104],"estimator":[3],"methods":[4],"suffer":[5],"from":[6],"problems":[7,29],"such":[8],"as":[9],"high":[10,20],"time":[11,61],"complexity":[12,62,68],"of":[13,64,99,105,138,164],"O(n":[14],"<sup":[15],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[16],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[17],")":[18],"and":[19,51,66,129,132,157],"memory":[21],"requirement":[22],"especially":[23],"when":[24],"indexing":[25],"is":[26,44,76,107,115,124,146],"used.":[27],"These":[28],"produce":[30],"limitations":[31],"on":[32,117,154],"applying":[33],"them":[34],"for":[35],"small":[36],"datasets.":[37],"In":[38],"this":[39,110],"paper":[40],"a":[41,86],"new":[42,87],"method":[43,84,123,145],"proposed":[45,83,122,140,144,166],"that":[46],"calculates":[47],"distances":[48],"to":[49,55,78,89,102,109,126,148],"nearest":[50],"farthest":[52],"neighbor":[53],"nodes":[54],"make":[56],"dataset":[57],"subgroups;":[58],"therefore,":[59],"computational":[60],"becomes":[63,69],"O(nlogn)":[65],"space":[67],"constant.":[70],"After":[71],"subgroup":[72],"formation,":[73],"assembling":[74],"technique":[75],"used":[77],"derive":[79],"correct":[80],"clusters.":[81],"The":[82,97,121],"uses":[85],"parameter":[88,111],"detect":[90],"clusters":[91,106],"which":[92,112],"are":[93],"not":[94],"obviously":[95],"separable.":[96],"ratio":[98],"middle":[100],"point":[101],"minimum":[103],"compared":[108,147],"its":[113],"value":[114],"dependent":[116],"the":[118,133,136,139,143,149,158,165],"clustering":[119],"problem.":[120],"applied":[125],"both":[127],"synthetized":[128],"real-world":[130,155],"datasets":[131,156],"results":[134,159],"demonstrated":[135],"feasibility":[137],"method.":[141,167],"Furthermore,":[142],"similar":[150],"algorithm":[151],"-":[152],"DBSCAN-":[153],"showed":[160],"significantly":[161],"higher":[162],"accuracy":[163]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}