Proceedings 2001 IEEE International Conference on Data Mining
DOI: 10.1109/icdm.2001.989592
|View full text |Cite
|
Sign up to set email alerts
|

A simple KNN algorithm for text categorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
85
0
3

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 176 publications
(88 citation statements)
references
References 0 publications
0
85
0
3
Order By: Relevance
“…The loan time information is 2 dimensions, respectively for user id and loan time [13]. The customer has a 2-dimensional record of the delinquent behavior, which is the user id and the overdue label.…”
Section: Data Preprocessingmentioning
confidence: 99%
“…The loan time information is 2 dimensions, respectively for user id and loan time [13]. The customer has a 2-dimensional record of the delinquent behavior, which is the user id and the overdue label.…”
Section: Data Preprocessingmentioning
confidence: 99%
“…To improve the retrieval accuracy of our system, k-nearest neighbor (k-NN), a widely used method in text classification [18] was employed. Text classification is the process of identifying the class to which a text document belongs.…”
Section: Prototype Iterationsmentioning
confidence: 99%
“…The k-nearest neighbor algorithm is simple and widely used in text classification [18]. An object is classified by a majority vote of its k-nearest neighbors.…”
Section: Identifying Confucius Entrymentioning
confidence: 99%
“…For the purposes of the experiments, we developed the kNN classification tool. For the SVM classifications, we used the Multi-Class Support Vector Machine of SVMlight from Cornell University and the University of Dortmund [2], [9]. We tested the classifications using the 'linear' kernel function for SVMlight, k being the number of classes for each dataset for kNN.…”
Section: Experiments and Evaluationsmentioning
confidence: 99%