A Model for Term Selection in Text Categorization Problems

Due to the era of Big Data and the rapid growth in textual data, text classification becomes one of the key techniques for handling and organizing the text data. Feature selection is the most important step in automatic text categorization. In order to choose a subset of available features by eliminating unnecessary features to the classification task, a novel text categorization algorithm called chaos genetic feature selection optimization is proposed. The proposed algorithm selects the optimal subsets in both empirical and theoretical work in machine learning and presents a general framework for text categorization. Experimental results show that the proposed algorithm simplifies the feature selection process effectively and can obtain higher classification accuracy with a smaller feature set.

With overwhelming growth of information technology, better organization of documents is required for easy access of information. Hence the need for text categorization becomes critical. Many researchers have turned their attention towards text categorization. Text categorization is the automated assignment of predefined categories to the text documents based on document contents. We proposed an automatic text categorization approach that uses profiles for categorization of text documents. A new similarity method has been used for measuring similarity between profiles and documents. We have explored different ways of profile creation and concluded that the increase in distance between profiles improves the classifier performance. Our classifier has an improved performance when compared with similar kind of text categorization methods

Since electronic files were first introduced, automated text categorization has been a significant application and research area. Documents provide a wealth of important human information. Automated text categorization has become necessary due to the exponential increase in the number of documents that are readable by machines and available for either public or confidential access. The sheer volume of written material we handle daily makes text categorization necessary in today's world. Text categorization generally comprises two types of classification: genre-based and topic-based. Topic-based text categorization organizes texts based on their subjects, and the majority of information for genre classification comes from the internet, discussion boards, forums, and televised or print media. This document presents a comprehensive summary of the outcomes of several feature choices, classification techniques, and evaluation techniques. It offers a comprehensive overview and analysis of the research conducted on text categorization using several text classification methods.

Automated multi-label text categorization with VG-RAM weightless neural networks

In the text classification, The similarity between the text need to be calculated, but the existing classification methods only consider the similarity between feature words and categories and does not involve the semantic similarity between feature words. In this paper, a new classification model LDA (Latent Dirichlet Allocation) - KNN (K-Nearest Neighbor) is proposed. LDA is used to solve the problem of semantic similarity measurement in traditional text categorization. The sample space is modeled and selected by this model. In the reduced feature space, KNN classifier is used to classify the sample. The experiment was based on the Matlab software platform, and the data set was obtained from the Chinese corpus of Fudan University, and the high precision classification result was obtained with the average value of 0.933. LDA-KNN model is compared with MI(Mutual Information)-KNN model and LSI(Latent Semantic Index)-KNN model. The results show that LDA-KNN model has superior classification performance in automatic text categorization.

In this paper we deal with the main aspect of the problem of extracting meaning from documents, namely, with the problem of text categorization, outlining a novel and systematic approach to its solution. We present a text categorization system for non-domain specific full-text documents. The main contribution of this paper lies on the feature extraction methodology which, first, involves word semantic categories and not raw words as other rival approaches. As a consequence of coping with the problem of dimensionality reduction, the proposed approach introduces a novel second and third order feature extraction approach for text categorization by considering word semantic categories cooccurrence analysis. The suggested methodology compares favorably to widely accepted, raw word frequency based techniques in a collection of documents concerning the Dewey Decimal Classification (DDC) system. In these comparisons different Multilayer Perceptrons (MLP) algorithms, the LVQ and the conventional k-NN technique are involved.

Over recent years, the world has experienced explosive growth in the volume of textual data, which makes a manual analysis impossible. Machine learning techniques provided an effective solution to this problem. Due to its capacity to organize the huge and varied amounts of data, it offered valuable insights and it has become an emerging investigative field for the research community. Classification techniques are used to classify data into different classes according to desired criteria. By their simplicity, they give rise to a variety of applications: automated text categorization, opinion mining, and so forth. These processes go through three stages: text representation, features extraction, and the classification process; they still face many difficulties due both to the complex nature of text databases and to the high dimensionality of texts representations. This article presents a new classification approach that learns to classify texts from the most reliable features more accurately. The added advantage of the proposed approach is that it automatically classifies a text without necessarily processing all its features. The experimental results showed that this new classification by thresholds outperforms the state‐of‐the‐art methods. As a result, the obtained f‐measure on automatic text categorization was 95.06% while it is lower on opinion mining.

Automatic Text Categorization (ATC) is a task of categorizing an electronic document to a predefined category automatically based on its content. There are many supervised Machine Learning (ML) techniques that has been used to solve Text Categorization (TC) problem. The complex morphology of Arabic language and its large vocabulary size makes using these techniques difficult and costly in time and attempt. We have investigated Bayesian learning which is based on Bayesian theorem to deal with Arabic ATC problem. Bayesian learning classifiers that have been applied are Multivariate Guess Naive Bayes (MGNB), Flexible Bayes (FB), Multivariate Bernoulli Naive Bayes (MBNB), and Multinomial Naive Bayes (MNB). For text representation in terms of word level NGram, 1-Gram, 2-Gram and 3-Gram have been used. For Arabic stemming, a simple stemmer called TREC-2002 Light Stemmer is used in the prototype. For feature selection we have used several feature selection techniques i.e. Chi-Square Statistic (CHI), Odd Ratio (OR), Mutual Information (MI), and GSS Coefficient (GSS). The results showed that FB outperforms MNB, MBNB, and MGNB. The experimental results of this work proved that using word level n-gram for ATC based on Bayesian learning leads to acceptable results.

The term weighting scheme, which is used to convert documents into vectors in the term spaces, is a vital step in automatic text categorization. The previous studies showed that term weighting schemes dominate the performance rather than the kernel functions of SVMs for the text categorization task. In this paper, we conducted experiments to compare various term weighting schemes with SVM on two widely-used benchmark data sets. We also presented a new term weighting scheme tf.rf for text categorization. The cross-scheme comparison was performed by using McNemar's tests. The controlled experimental results showed that the newly proposed tf.rf scheme is significantly better than other term weighting schemes. Compared with schemes related with tf factor alone, the idf factor does not improve or even decrease the term's discriminating power for text categorization. The binary and tf.chi representations significantly underperform the other term weighting schemes.

In the recent past, the growth of Sinhala text usage on the web has been increasing rapidly due to the advancement in the field of information and communication technologies in Sri Lanka. With this change in society, automatic text categorization becomes important for many operations in computing. Therefore, the aim of this research is to assess commonly used rule based text classification algorithms against the Sinhala dataset. This study is limited to rule based classifiers as they are humanly interpretable by nature, which gives an added advantage to text classification. This paper presents a. The comparison of experiment results of rule based classifiers b. SinNG5 corpus and Sinhala stop word list named as SinSWL. The corpus and stop word list are freely available for academic researches.

BackgroundWhile biomedical text mining is emerging as an important research area, practical results have proven difficult to achieve. We believe that an important first step towards more accurate text-mining lies in the ability to identify and characterize text that satisfies various types of information needs. We report here the results of our inquiry into properties of scientific text that have sufficient generality to transcend the confines of a narrow subject area, while supporting practical mining of text for factual information. Our ultimate goal is to annotate a significant corpus of biomedical text and train machine learning methods to automatically categorize such text along certain dimensions that we have defined.ResultsWe have identified five qualitative dimensions that we believe characterize a broad range of scientific sentences, and are therefore useful for supporting a general approach to text-mining: focus, polarity, certainty, evidence, and directionality. We define these dimensions and describe the guidelines we have developed for annotating text with regard to them.To examine the effectiveness of the guidelines, twelve annotators independently annotated the same set of 101 sentences that were randomly selected from current biomedical periodicals. Analysis of these annotations shows 70–80% inter-annotator agreement, suggesting that our guidelines indeed present a well-defined, executable and reproducible task.ConclusionWe present our guidelines defining a text annotation task, along with annotation results from multiple independently produced annotations, demonstrating the feasibility of the task. The annotation of a very large corpus of documents along these guidelines is currently ongoing. These annotations form the basis for the categorization of text along multiple dimensions, to support viable text mining for experimental results, methodology statements, and other forms of information. We are currently developing machine learning methods, to be trained and tested on the annotated corpus, that would allow for the automatic categorization of biomedical text along the general dimensions that we have presented. The guidelines in full detail, along with annotated examples, are publicly available.

Many techniques and algorithms for automatic text categorization had been devised and proposed in the literature. However, there is still much space for researchers in this area to improve existing algorithms or come up with new techniques for text categorization (TC). Polynomial Networks (PNs) were never used before in TC. This can be attributed to the huge datasets used in TC, as well as the technique itself which has high computational demands. In this paper, we investigate and propose using PNs in TC. The proposed PN classifier has achieved a competitive classification performance in our experiments. More importantly, this high performance is achieved in one shot training (noniteratively) and using just 0.25%–0.5% of the corpora features. Experiments are conducted on the two benchmark datasets in TC: Reuters-21578 and the 20 Newsgroups. Five well-known classifiers are experimented on the same data and feature subsets: the state-of-the-art Support Vector Machines (SVM), Logistic Regression (LR), the k-nearest-neighbor (kNN), Naive Bayes (NB), and the Radial Basis Function (RBF) networks.

Automated text categorization has been measured as a crucial technique for run and practice a huge quantity of papers in digital appearances that were extensive & constantly growing. In common, text categorization acts a significant responsibility in data mining and summarization, text recovery, and query responding. Interruption recognition scheme plays an vital responsibility in network protection. Intrusion recognition method was a analytical method utilized for forecasting network information collision is common or Intrusion. ML algorithms were utilized to construct exact methods to grouping, categorization & guessing. Labeled text papers were utilized for classify text with supervised categorizations. This article used these classifiers in many types for labeled papers & evaluates correctness to classifiers. An artificial neural network (ANN) method utilizing back propagation network (BPN) is worked by more than a few additional techniques to build a autonomous policy to labeled & supervised text categorization procedure. The obtainable standard mechanism was used for analyzing working of categorization utilizing labeled papers. Investigational examination on actual information discloses for mechanism runs good in stipulations of categorization exactness.

With the rapid growth of Internet, more and more natural language text documents are available in electronic format, making automated text categorization a must in most fields. Due to the high dimensionality of text categorization tasks, feature selection is needed before executing document classification. There are basically two kinds of feature selection approaches: the filter approach and the wrapper approach. For the wrapper approach, a search algorithm for feature subsets and an evaluation algorithm for assessing the fitness of the selected feature subset are required. In this work, I focus on the comparison between two wrapper approaches. These two approaches use Particle Swarm Optimization (PSO) as the search algorithm. The first algorithm is PSO based K-Nearest Neighbors (KNN) algorithm, while the second is PSO based Rocchio algorithm. Three datasets are used in this study. The result shows that BPSO-KNN is slightly better in classification results than BPSO-Rocchio, while BPSO-Rocchio has far shorter computation time than BPSO-KNN.

Facing the spammers: A very effective approach to avoid junk e-mails