{"id":"https://openalex.org/W104146157","doi":null,"title":"Improved k-NN Algorithm for Text Classification.","display_name":"Improved k-NN Algorithm for Text Classification.","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W104146157","mag":"104146157"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.509.1990","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.509.1990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dbxlab.uta.edu/dbxlab/Muhammed/DMIN2009.pdf","raw_type":"text"},"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/A5083291324","display_name":"Muhammed Miah","orcid":"https://orcid.org/0000-0003-4800-2681","observed_orcids":["https://orcid.org/0000-0003-4800-2681"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Muhammed Miah","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4800-2681","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5083291324"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6519,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.8484995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"434","last_page":"440"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11550","display_name":"Text and Document Classification Technologies","score":1.0,"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/T11550","display_name":"Text and Document Classification Technologies","score":1.0,"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.0,"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/T10028","display_name":"Topic Modeling","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbor-algorithm","display_name":"k-nearest neighbor algorithm","score":0.8579999804496765},{"id":"https://openalex.org/keywords/text-classification","display_name":"text classification","score":0.9990000128746033},{"id":"https://openalex.org/keywords/decision-rules","display_name":"decision rules","score":0.7630000114440918},{"id":"https://openalex.org/keywords/class-bias","display_name":"class bias","score":0.7260000109672546},{"id":"https://openalex.org/keywords/classification-accuracy","display_name":"classification accuracy","score":0.5950000286102295}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5366335511207581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5123552083969116},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43707507848739624},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.3685763478279114}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.509.1990","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.509.1990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dbxlab.uta.edu/dbxlab/Muhammed/DMIN2009.pdf","raw_type":"text"},{"id":"mag:104146157","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/dmin/dmin2009.html#Miah09","pdf_url":null,"source":{"id":"https://openalex.org/S4306508216","display_name":"DMIN","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"DMIN","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":24,"referenced_works":["https://openalex.org/W49205724","https://openalex.org/W1524579289","https://openalex.org/W1528447234","https://openalex.org/W1550206324","https://openalex.org/W1570542661","https://openalex.org/W1879009681","https://openalex.org/W1969572066","https://openalex.org/W1970516776","https://openalex.org/W1979076595","https://openalex.org/W1986913017","https://openalex.org/W2005422315","https://openalex.org/W2013657661","https://openalex.org/W2014351296","https://openalex.org/W2023450550","https://openalex.org/W2040241219","https://openalex.org/W2062847911","https://openalex.org/W2094934653","https://openalex.org/W2115023510","https://openalex.org/W2132916392","https://openalex.org/W2135437125","https://openalex.org/W2147717514","https://openalex.org/W2149684865","https://openalex.org/W2435251607","https://openalex.org/W3042893949"],"related_works":["https://openalex.org/W2347771046","https://openalex.org/W2348887651","https://openalex.org/W2234687539","https://openalex.org/W2352013125","https://openalex.org/W2952879406","https://openalex.org/W2353958822","https://openalex.org/W2755772093","https://openalex.org/W2004633764","https://openalex.org/W2370085336","https://openalex.org/W2357826042"],"abstract_inverted_index":{"Abstract-":[0],"Over":[1],"the":[2,12,45,51,80,89,92,109],"last":[3],"twenty":[4],"years,":[5],"text":[6,21,39,127],"classification":[7,46,128],"has":[8,96],"become":[9],"one":[10],"of":[11,47,53,91,114,120],"key":[13],"techniques":[14],"for":[15,38,138],"organizing":[16],"electronic":[17],"information":[18],"such":[19],"as":[20,141],"and":[22,35,132],"web":[23],"documents.":[24,121],"The":[25,41,130],"k-Nearest":[26],"Neighbor":[27],"(k-NN)":[28],"algorithm":[29,37,43,65,135],"is":[30,84,136],"a":[31,67,72],"very":[32],"well":[33],"known":[34],"popular":[36],"classification.":[40],"k-NN":[42,64,134],"determines":[44],"new":[48,131],"document":[49,73,81],"by":[50,111],"class":[52,103,116],"its":[54],"k-nearest":[55,105],"neighbor.":[56],"In":[57],"this":[58],"paper":[59],"we":[60],"propose":[61],"an":[62,97],"improved":[63,98,133],"with":[66,117],"built-in":[68],"technique":[69],"to":[70,101,107],"skip":[71],"from":[74,104],"training":[75],"corpus":[76],"without":[77],"looking":[78],"inside":[79],"if":[82],"it":[83],"not":[85],"important,":[86],"which":[87],"improves":[88],"performance":[90],"algorithm.":[93],"It":[94],"also":[95],"decision":[99],"rule":[100],"identify":[102],"neighbor":[106],"improve":[108],"accuracy":[110],"avoiding":[112],"bias":[113],"dominating":[115],"large":[118],"number":[119],"We":[122],"conduct":[123],"experiments":[124],"on":[125],"benchmark":[126],"datasets.":[129],"suitable":[137],"other":[139],"applications":[140],"well.":[142]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}