Neighbor-weighted K-nearest neighbor for unbalanced text corpus
Expert Systems with ApplicationsPublished 13 January 2005
S TAN
Citations344
SJR quartileQ1
SJR score1.85
SNIP2.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The neighbor-weighted K-nearest neighbor algorithm, i.e. NWKNN, is proposed, which achieves significant classification performance improvement on imbalanced corpora.
Abstract
Text categorization or classification is the automated assigning of text documents to pre-defined classes based on their contents. Many of classification algorithms usually assume that the training examples are evenly distributed among different classes. However, unbalanced data sets often appear in many practical applications. In order to deal with uneven text sets, we propose the neighbor-weighted K-nearest neighbor algorithm, i.e. NWKNN. The experimental results indicate that our algorithm NWKNN achieves significant classification performance improvement on imbalanced corpora.
Keywords
Computer Science
Information Processing & ManagementTerm-weighting approaches in automatic text retrieval
9,532 Citations1988Gerard Salton, Chris Buckley
This paper summarizes the insights gained in automatic term weighting, and provides baseline single term indexing models with which other more elaborate content analysis procedures can be compared.
Lecture notes in computer scienceText categorization with Support Vector Machines: Learning with many relevant features
7,925 Citations1998Thorsten Joachims
SVMs achieve substantial improvements over the currently best performing methods and behave robustly over a variety of di-erent learning tasks, eliminating the need for manual parameter tuning.
A re-examination of text categorization methods
2,660 Citations1999Yiming Yang, Xin Liu
The results show that SVM, kNN and LLSF signi cantly outperform NNet and NB when the number of positive training instances per category are small, and that all the methods perform comparably when the categories are over 300 instances.
Lecture notes in computer scienceNaive (Bayes) at forty: The independence assumption in information retrieval
2,092 Citations1998David Lewis
The naive Bayes classifier, currently experiencing a renaissance in machine learning, has long been a core technique in information retrieval, and some of the variations used for text retrieval and classification are reviewed.
Information RetrievalAn Evaluation of Statistical Approaches to Text Categorization
1,946 Citations1999Yiming Yang
Analysis and empirical evidence suggest that the evaluation results on some versions of Reuters were significantly affected by the inclusion of a large portion of unlabelled documents, mading those results difficult to interpret and leading to considerable confusions in the literature.
Training algorithms for linear text classifiers
516 Citations1996David Lewis, Robert E. Schapire +2 more
This work proposes that two machine learning algorithms, the Widrow-Hoff and EG algorithms, be used in training linear text classifiers for IR tasks, and theoretical analysis provides performance guarantees and guidance on parameter settings for these algorithms.
Learning from Imbalanced Data Sets: A Comparison of Various Strategies *
453 Citations2000Nathalie Japkowicz
It is shown experimentally that, at least in the case of connectionist systems, class imbalances hinder the performance of standard classifiers and several approaches previously proposed to deal with the problem are compared.
Lecture notes in computer scienceCentroid-Based Document Classification: Analysis and Experimental Results
406 Citations2000Eui-Hong Han, George Karypis
The authors' experiments show that this centroidbased classifier consistently and substantially outperforms other algorithms such as Naive Bayesian, k-nearest-neighbors, and C4.5, on a wide range of datasets.
Bayesian online classifiers for text classification and filtering
115 Citations2002Kian Ming A. Chai, Hai Leong Chieu +1 more
Empirical results indicate that these Bayesian online classifiers are comparable with the best text classification systems and the online approach offers the advantage of continuous learning in the batch-adaptive text filtering task.
Learning routing queries in a query zone
104 Citations1997Amit Singhal, Mandar Mitra +1 more
This study shows that routing queries learned only from the documents in a query domain are better than the routing profiles learned when query domains are not used, and approximate a querydomain by a guerg zone.
Centroid-Based Document Classification Algorithms: Analysis & Experimental Results
52 Citations2000Eui-Hong Han, George Karypis
This paper focuses on a simple linear-time centroid-based document classification algorithm that consistently and substantially outperforms other algorithms such as Naive Bayesian, k-nearest-neighbors, and C4.5, on a wide range of datasets.