Using the Cluster-based Tree Structure of k-Nearest Neighbor to Reduce the Effort Required to Classify Unlabeled Large Datasets.
Elias OliveiraHoward RoattiMatheus de Araujo NogueiraHenrique Gomes BasoniPatrick Marques CiarelliPublished in: KDIR (2015)
Keyphrases
- tree structure
- k nearest neighbor
- knn
- nearest neighbor
- data structure
- tree structures
- text categorization
- index structure
- classification method
- xml documents
- quadtree
- knn algorithm
- binary classification tasks
- support vector machine
- knn classifier
- neural network
- b tree
- spatial networks
- semi supervised learning
- nearest neighbour
- frequent patterns
- graph construction
- data sets
- tree representation
- text classification
- hierarchical document clustering
- k nearest neighbour
- benchmark datasets
- distance function
- labeled data
- data points
- databases
- metric space
- similarity search
- support vector
- feature selection