2015 · 10 citations · 4 references
ComputingComputer ScienceDistributed SystemsInformation RetrievalMachine LearningClassificationDimensionality ReductionNearest Neighbor SearchWeb MiningWeb SearchK-nearest Neighbor SearchK-nearest NeighborsLarge-scale ClassificationNearest-neighbor ClassificationOnline Information SearchWeb Page Classification
Nowadays, while we are enjoying the convenience brought by such a huge repository of online web information, we may come across difficulties in finding the web pages we want related to particular information we are searching for. Hence, it is essential to classify web documents to facilitate the search and retrieval of pages. Existing algorithms work well with a small quantity of web pages, whereas, they become slow and even non-effective while dealing with a large scale of web pages. Recently, some of these algorithms were adapted to distributed platforms which boosted their classification speeds effectively. However, due to high dimensions of web page features, the parallel classifiers were still trained with limited capacity training sets. In addition, these methods didn't improve the classification itself, merely boosted by high computing performance of distributed platforms. So oriented to large-scale web page classification, we propose to integrate anchor graph hashing with K-Nearest Neighbour(KNN) classifier to reduce the pages' original feature dimensions. The hash value of each page is used for training and classification instead of the original vectors. Experimental comparison with the original KNN on a large dataset demonstrates the efficacy of our proposed method.
4
Yair Weiss, Antonio Torralba, Rob Fergus · neural information processing systems · 2008 · 2.1K citations
Large Graph Construction for Scalable Semi-Supervised Learning
Wei Liu, Junfeng He, Shih‐Fu Chang · 2010 · 498 citations