Performing Text Categorization on Manifold
Published 1 October 2006
Guihua Wen, Gan Chen, Lijun Jiang
Citations4
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
This paper presents an approach that performs text categorization on texts manifold with respect to the intrinsic global manifold structure, such as by geodesic distance to measure the distance between two texts.
Abstract
Text categorization has become the key technology in organizing and processing the large amount of text information. It normally involves an extremely high dimensional space, which makes most existing approaches generate highly biased estimates so as to reduce the classification accuracy. These approaches do not consider that the text documents may be intrinsically located on the low-dimensional manifold. This paper presents an approach that performs text categorization on texts manifold with respect to the intrinsic global manifold structure, such as by geodesic distance to measure the distance between two texts. This approach has been applied to improve the KNN for text categorization. This is empirically validated by the conducted experiments.
Keywords
Computer Science
ScienceNonlinear Dimensionality Reduction by Locally Linear Embedding
15,035 Citations2000Sam T. Roweis, Lawrence K. Saul
Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
ScienceA Global Geometric Framework for Nonlinear Dimensionality Reduction
13,740 Citations2000Joshua B. Tenenbaum, Vin de Silva +1 more
An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
ACM Computing SurveysMachine learning in automated text categorization
7,899 Citations2002Fabrizio Sebastiani
This survey discusses the main approaches to text categorization that fall within the machine learning paradigm and discusses in detail issues pertaining to three different problems, namely, document representation, classifier construction, and classifier evaluation.
ScienceThe Isomap Algorithm and Topological Stability
844 Citations2002Mukund Balasubramanian, Eric L. Schwartz
An algorithm for computing a quasi-isometric, low-dimensional embedding of a set of high-dimensional data points and the basic approach presented is not new, having been presented previously.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Supervised Nonlinear Dimensionality Reduction for Visualization and Classification
427 Citations2005Xiaowei Geng, Dongyuan Zhan +1 more
An improved version of Isomap, namely S-Isomap, is proposed, and it is revealed that S-Isomap excels compared to Isomap and WeightedIso in classification, and it is highly competitive with those well-known classification methods.
ACM Transactions on Information SystemsContext-sensitive learning methods for text categorization
359 Citations1999William W. Cohen, Yoram Singer
RIPPER and sleeping-experts perform extremely well across a wide variety of categorization problems, generally outperforming previously applied learning methods and are viewed as a confirmation of the usefulness of classifiers that represent contextual information.
ACM Transactions on Information SystemsExploiting hierarchical domain structure to compute similarity
356 Citations2003Prasanna Ganesan, Héctor García-Molina +1 more
This work proposes new measures that exploit a hierarchical domain structure in order to produce more intuitive similarity scores, and provides an experimental comparison of the measures against traditional similarity measures, and reports on a user study that evaluated how well the measures match human intuition.
Expert Systems with ApplicationsNeighbor-weighted K-nearest neighbor for unbalanced text corpus
344 Citations2005S TAN
The neighbor-weighted K-nearest neighbor algorithm, i.e. NWKNN, is proposed, which achieves significant classification performance improvement on imbalanced corpora.
Lecture notes in computer scienceSupervised Locally Linear Embedding
279 Citations2003Dick de Ridder, Olga Kouropteva +3 more
Two extensions of LLE to supervised feature extraction were independently proposed by the authors of this paper and are unified in a common framework and applied to a number of benchmark data sets.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Learning From Examples in the Small Sample Case: Face Expression Recognition
194 Citations2005Guodong Guo, Charles R. Dyer
A new technique based on linear programming for both feature selection and classifier training is introduced and a pairwise framework for feature selection, instead of using all classes simultaneously, is presented.
ACM Transactions on Asian Language Information ProcessingAn adaptive <i>k</i> -nearest neighbor text categorization strategy
108 Citations2004Baoli Li, Qin Lu +1 more
Experiments show that the improved kNN strategy, in which different numbers of nearest neighbors for different categories are used instead of a fixed number across all categories, is especially applicable and promising for cases where estimating the parameter k via cross-validation is not possible and the class distribution of a training set is skewed.
Applied IntelligenceOn Machine Learning Methods for Chinese Document Categorization
72 Citations2003Ji He, Ah-Hwee Tan +1 more
A comparative evaluation of three machine learning methods, namely k Nearest Neighbor, Support Vector Machines (SVM), and Adaptive Resonance Associative Map for Chinese document categorization found that SVM is highly efficient in learning from well organized samples of moderate size, although on relatively large and noisy data the efficiency of SVM and ARAM are comparable.
IEEE Transactions on Knowledge and Data EngineeringOn using partial supervision for text categorization
71 Citations2004Charų C. Aggarwal, Stephen C. Gates +1 more
It is shown that the advantage of using partially supervised clustering is that it is possible to have some control over the range of subjects that one would like the categorization system to address, but with a precise mathematical definition of how each category is defined.
Text classification with kernels on the multinomial manifold
67 Citations2005Dell Zhang, Xi Chen +1 more
It is proved that the Negative Geodesic Distance (NGD) on the multinomial manifold is conditionally positive definite (cpd), thus can be used as a kernel in SVMs, significantly outperforming standard kernels on the ambient Euclidean space.
IEEE Transactions on Geoscience and Remote SensingAn adaptive fuzzy evidential nearest neighbor formulation for classifying remote sensing images
65 Citations2005Hongwei Zhu, Otman Basir
The paper presents a novel adaptive fuzzy evidential nearest neighbor formulation for classifying remotely sensed images that combines the generalized fuzzy version of the Dempster-Shafer evidence theory and the K-nearest neighbor algorithm to achieve the adaptive capability during the classification process.
IEEE Transactions on Pattern Analysis and Machine IntelligenceAutomatic textual document categorization based on generalized instance sets and a metamodel
61 Citations2003Wai Lam, Yiqiu Han
This work proposes a new approach to text categorization known as generalized instance set (GIS) algorithm under the framework of generalized instance patterns, which unifies the strengths of k-NN and linear classifiers and adapts to characteristics ofText categorization problems.
IEEE Transactions on Knowledge and Data EngineeringBlocking reduction strategies in hierarchical text classification
55 Citations2004Aixin Sun, Ee‐Peng Lim +2 more
Three methods are proposed to address the blocking problem, namely, threshold reduction, restricted voting, and extended multiplicative, and it is shown that the Restricted Voting method delivered the best performance.