2009 International Conference on Information Technology and Computer Science 2009
DOI: 10.1109/itcs.2009.57
View full text |Buy / Rent full text
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 5 publications
references
References 5 publications
0
2
0
Order By: Relevance
“…Even though the convergence speed of this algorithm is already at the forefront compared with other existing optimization algorithms', there is a huge amount of computation that cannot be ignored. Moreover, the time complexity of the k-NN algorithm applied to this scene is O(n) [28]. Using the original user data in the database, its operation is relatively simple.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Even though the convergence speed of this algorithm is already at the forefront compared with other existing optimization algorithms', there is a huge amount of computation that cannot be ignored. Moreover, the time complexity of the k-NN algorithm applied to this scene is O(n) [28]. Using the original user data in the database, its operation is relatively simple.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Xiaofei Zhang, Heyan Huang and Keliang Zhang introduced a KNN text categorization algorithm based on semantic centre, which replaced the large number of original sample documents with a small amount of sample semantic centers [16]. Experiments proved it worked over 10 times as fast as that of the traditional KNN and its F 1 value was approximately equal to SVM and traditional KNN algorithm.…”
Section: Zhenyu Lu Yongmin Liu Shuang Zhao and Xuebinmentioning
confidence: 99%