- Research Article
24
- 10.1016/j.procs.2014.05.314
Feature Extension for Short Text Categorization Using Frequent Term Sets
- Jan 01, 2014
- Procedia Computer Science
- Yuan Man
Feature Extension for Short Text Categorization Using Frequent Term Sets
In order to conquer the major challenges of current web document clustering, i.e. huge volume of documents, high dimensional process and understandability of the cluster, we propose a simple hybrid algorithm (SHDC) based on top-k frequent term sets and k-means. Top-k frequent term sets are used to produce k initial means, which are regarded as initial clusters and further refined by k-means. The final optimal clustering is returned by k-means while the understandable description of clustering is provided by k frequent term sets. Experimental results on two public datasets indicate that SHDC outperforms other two representative clustering algorithms (the farthest first k-means and random initial k-means) both on efficiency and effectiveness.
Feature Extension for Short Text Categorization Using Frequent Term Sets
Feature Extension for Short Text Categorization Using Frequent Term Sets
A Study on Text Clustering Algorithms Based on Frequent Term Sets
In this paper, a new text-clustering algorithm named Frequent Term Set-based Clustering (FTSC) is introduced. It uses frequent term sets to cluster texts. First, it extracts useful information from documents and inserts into databases. Then, it uses the Apriori algorithm based on association rules mining efficiently to discover the frequent items sets. Finally, it clusters the documents according to the frequent words in subsets of the frequent term sets. This algorithm can reduce the dimension of the text data efficiently for very large databases, thus it can improve the accuracy and speed of the clustering algorithm. The results of clustering texts by the FTSC algorithm cannot reflect the overlap of texts' classes. Based on the FTSC algorithm, an improved algorithm—Frequent Term Set-based Hierarchical Clustering algorithm (FTSHC) is given. This algorithm can determine the overlap of texts' classes by the overlap of the frequent words sets, and provide an understandable description of the discovered clusters by the frequent terms sets. The FTSC, FTSHC and K-Means algorithms are evaluated quantitatively by experiments. The results of the experiments prove that FTSC and FTSHC algorithms are more efficient than K-Means algorithm in the performance of clustering.
Read moreThe research of text clustering algorithms based on frequent term sets
In this paper, we present a text-clustering algorithm of frequent term set-based clustering (FTSC), which uses frequent term sets for texts clustering. This algorithm can reduce the dimensionality of the text data efficiently, thus it can improve accurate rate and running speed of the clustering algorithm. The results of clustering texts by the FTSC algorithm cannot reflect the overlap of texts' classes. Based on the FTSC algorithm, its improved algorithm - frequent term set-based hierarchical clustering algorithm (FTSHC) is given. This algorithm can determine the overlap of texts' classes by the overlap of frequent words sets, and provide an understandable description of the discovered clusters by the frequent terms sets. The experiment results prove that FTSC and FTSHC algorithms are more efficient than K-Means algorithm in the performance of clustering.
Read moreShort Text Feature Extension Based on Improved Frequent Term Sets
A short text feature extension algorithm based on improved frequent word set is proposed. By calculating support and confidence, the same category tendencies of frequent term sets are extracted. Correlations based frequent term sets are defined to further extend the term set. Meanwhile, information gain is introduced to traditional TF-IDF, better expressing the category distribution information and the weight of word for each category is enhanced. All term pairs with external relations are extracted and the frequent term set is expanded. Finally, the word similarity matrix is constructed via the frequent word set, and the symmetric non-negative matrix factorization technique is applied to extend the feature space. Experiments show that the constructed short text model can improve the performance of short text clustering.
Read moreStudy on frequent term set-based hierarchical clustering algorithm
This paper, we present a text-clustering algorithm of Frequent Term Set-based Clustering (FTSC), which uses frequent term sets for texts clustering. This algorithm can reduce the dimensionality of the text data efficiently, thus it can improve accurate rate and running speed of the clustering algorithm. The results of clustering texts by the FTSC algorithm cannot reflect the overlap of texts' classes. Based on the FTSC algorithm, its improved algorithm-Frequent Term Set-based Hierarchical Clustering algorithm (FTSHC) is given. This algorithm can determine the overlap of texts' classes by the overlap of frequent words sets, and provide an understandable description of the discovered clusters by the frequent terms sets. The experiment results prove that FTSC and FTSHC algorithms are more efficient than K-Means algorithm in the performance of clustering.
Read moreA method of two-stage clustering learning based on improved DBSCAN and density peak algorithm
A method of two-stage clustering learning based on improved DBSCAN and density peak algorithm
An Integrated Approach and Framework for Document Clustering Using Graph Based Association Rule Mining
Growth in number of documents increases day by day, and for managing this growth the document clustering techniques are used document clustering is a significant tool to allocating web search engines for data mining and knowledge discovery. In this paper, we have introduced a new framework graph-based frequent Term set for document clustering (GBFTDC). In this study, document clustering has been performed for extraction of useful information from document dataset based on frequent term set. We have generated association rules to perform pre-processing and then have applied clustering approach.
Read moreMulti-Instance Learning Based Web Mining
In multi-instance learning, the training set comprises labeled bags that are composed of unlabeled instances, and the task is to predict the labels of unseen bags. In this paper, a web mining problem, i.e. web index recommendation, is investigated from a multi-instance view. In detail, each web index page is regarded as a bag, while each of its linked pages is regarded as an instance. A user favoring an index page means that he or she is interested in at least one page linked by the index. Based on the browsing history of the user, recommendation could be provided for unseen index pages. An algorithm named Fretcit-kNN, which employs the Minimal Hausdorff distance between frequent term sets and utilizes both the references and citers of an unseen bag in determining its label, is proposed to solve the problem. Experiments show that in average the recommendation accuracy of Fretcit-kNN is 81.0% with 71.7% recall and 70.9% precision, which is significantly better than the best algorithm that does not consider the specific characteristics of multi-instance learning, whose performance is 76.3% accuracy with 63.4% recall and 66.1% precision.
Read moreFeature Selection Algorithm Based on Association Rules
Feature selection is one of the key issues in pattern recognition. The quality of the feature selection has a direct impact on the classification accuracy and generalization performance of the classifier. In order to reduce the size of the feature subset and improve the efficiency of the algorithm without reducing the accuracy, this paper proposes a feature selection algorithm based on association rules, ARFS. The algorithm uses association rules to mine the frequent 2-items set of the feature attributes and category in the dataset. Then the algorithm sorts the features according to the confidence of the frequent 2-items set, and then combines the sequential forward selection method, and uses the classification performance of the decision tree classifier as the evaluation criteria of the feature subsets. In terms of experiments, this paper selects five public datasets in the UCI Machine Learning Repository to conducted three comparison experiments of feature subset selection, learning algorithm accuracy and runtime for four feature selection algorithms. Experimental results show that the ARFS is superior to the contrast method in the feature subset size and the accuracy. However, the ARFS is slightly inferior to the ReliefF algorithm in the runtime.
Read moreAn Optimized k-means Algorithm Based on Information Entropy
Clustering is a widely used technique in data mining applications and various pattern recognition applications, in which data objects are divided into groups. K-means algorithm is one of the most classical clustering algorithms. In this algorithm, the initial clustering centers are randomly selected, this results in unstable clustering results. To solve this problem, an optimized algorithm to select the initial centers is proposed. In the proposed algorithm, dispersion degree is defined, which is based on entropy. In the algorithm, all the objects are firstly grouped into a big cluster, and the object that has the maximum dispersion degree and the object that has the minimum dispersion degree are selected as the initial clustering centers from the initial big cluster. And then other objects in the biggest cluster are partitioned to the initial clusters to which the objects are nearest. The partition process will be repeated until the cluster number is equal to the specified value k. Finally, the partitioned k clusters and their cluster centers are applied to k-means algorithm as initial clusters and centers. Several experiments are conducted on real data sets to evaluate the proposed algorithm. The proposed algorithm is compared with traditional k-means algorithm and max-min distance clustering algorithm, and experimental results show that the improved k-means algorithm is stable in selecting initial clustering, because it can select unique initial clustering centers. The optimized algorithm’s effectiveness and feasibility are also verified by experiments, and the algorithm can reduce the times of iterations and has more stable clustering results and higher accuracy.
Read moreThe Roots of Old Chinese (review)
Reviewed by: The roots of Old Chinese by Laurent Sagart Gonzalo Rubio The roots of Old Chinese. By Laurent Sagart. (Current issues in linguistic theory 184.) Amsterdam & Philadelphia: John Benjamins, 1999. Pp. xi, 255. One of the most important consequences of the last 80 years of research in Old Chinese (OC) concerns the discovery of the morphology of what was regarded as the isolating language par excellence. Reconstructing final consonantal clusters in codas (which carried the rhymes in the major corpus of OC, the poems of the Shījīng) and initial clusters shed light not only on the complex phonotactics of OC but also on the elements of derivational morphology which were responsible for the formation of semantically related words as well as personal pronouns. The main steps in this unveiling process were marked by the works of Bernhard Karlgren (with their culmination in Grammata serica recensa, Stockholm: Museum of Far Eastern Antiquities, 1964), Edwin G. Pulleyblank (Middle Chinese, Vancouver: University of British Columbia, 1984), and William H. Baxter (A handbook of Old Chinese phonology, Berlin: Mouton de Gruyter, 1992). Whereas all these efforts were focused on phonology and, therefore, any morphological findings were a rather accidental byproduct, Sagart vindicates the figure of Henri Maspero, whose work on OC morphology would have probably reached groundbreaking conclusions if he had not died a victim of the Nazi horror in Buchenwald in March 1945. In his 1934 article (Bulletin of the Museum of Far Eastern Antiquities 5.1–112), Karlgren dealt with several morphological alternations within word families, but he did not suggest that affixes were responsible for such alternations. However, in a 1930 article (Mémoires de la Société de Linguistique 23.313–27), Maspero pointed to the existence and productivity of affixes in OC. Ten years earlier, he had also pioneered the research concerning initial consonantal clusters in OC (Bulletin de l’École française d’Extrême-Orient 20.1–124). S summarizes these and other contributions by Maspero (2–4), placing them in the context of the later developments in the reconstruction of OC and the progressive introduction of the concept of affixation as an explanation for what appear as derivational elements employed in both general Wortbildung and in the pronominal system. One of S’s most valuable assets lies in the use of comparative material from other Sino-Tibetan languages which provide further support for some of the proposals made in this book. After a very informative introduction (1–12), the first half of this book deals with the phonological and morphological aspects of the so-called ‘word families’. S first explains the nature of OC words and roots (13–23) together with their root segmentals and the syllabic structure of OC (24–62). Diverse chapters devoted to several prefixes follow: *s- (63–73), used to derive causative, denominative, directive, and perhaps inchoative verbs, as well as to derive nouns from verbs; *N- (74–78)—instead of the voiced laryngeal *ɦ- as Pulleyblank and Baxter reconstruct—a nasal prefix which assimilates its articulation point to the following consonant and which generates intransitive verbs out of transitive ones; *m- (79–86), which probably marks the controlled or volitional nature of the action indicated with a verb; *p- (87–89), whose function remains obscure; *t- (90–97), deriving mostly intransitive and stative verbs from other verbs, as well as generally uncountable nouns; *k- (98–107), which seems to mark an iterative Aktionsart in many instances; *q- (108–9); and voiced stop prefixes (110). The reconstruction of infixes in OC is especially interesting for the alleged implications of traditional language types. OC exhibited at least one infix (111–20), *-r-, marking mostly repetitive action in verbs, dual or plural in nouns, and intensive in adjectives. This infix survives in the -l- of some modern Chinese dialects (e.g. Western Mı̌n Jiànōu kau8-lau8 ‘to stir’ from kau8). The study of prefixes and infixes is followed by chapters on initial clusters (121–30), suffixes (131–36), reduplication and compounding (137–38), and issues of etymology (139–141). The second part of the book is devoted to the study of different semantic fields and grammatical...
Read moreAssimilation to /r/ in English initial consonant clusters
THE RECENT Bulley-Davidson discussion of English initial consonant clusters (ET80, ET81, ET83) brings attention to the need for phonetic rigor and some phonological understanding when describing the sounds and sound patterns of English. Three topics the two writers deal with would benefit from such rigor: /tr/ and /dr/ clusters, the status and function of /j/ in initial clusters before /u/, and the role of syllable structure in the description of consonant clusters.
Read moreMulti-factor Influenced Integrated Driving Behavior Clustering Analysis Evaluation Model
For the discrete GPS driving behavior data, the traditional data clustering method cannot meet the rational clustering requirements. This paper analyzes and studies the commonly used clustering algorithms, as well as proposes an improved K-means++ algorithm for discrete data. In order to improve the accuracy of clustering, In order to improve the accuracy of clustering, the algorithm considers reducing the influence of non-principal components on data difference in the process of clustering difference metrics and gives the weighting process based on entropy weight method, so as to obtain a more reasonable clustering method. Finally, we implement the algorithm and apply it to the field of driving behavior analysis, and compare it with representative clustering algorithm. The experimental results show that the proposed algorithm has higher accuracy.
Read moreSymmetric Non-negative Matrix Factorization Based Link Partition Method for Overlapping Community Detection
Partitioning links rather than nodes is effective in overlapping community detection (OCD) on complex networks. However, it consumes high CPU and memory overheads because the volume of links is huge especially when the network is rather complex. In this paper, we proposes a symmetric non-negative matrix factorization (SNMF) based link partition method called SNMF-Link to overcome this deficiency. In particular, SNMFLink represents data in a lower-dimensional space spanned by the node-link incidence matrix. By solving a lighter SNMF problem, SNMF-Link learns the clustering indicators of each links. Since traditional multiplicative update rule (MUR) based optimization algorithm for SNMF suffers from slow convergence, we applied the augmented Lagrangian method (ALM) to efficiently optimize SNMF. Experimental results show that SNMF-Link is much more efficient than the representative clustering algorithms without reducing the OCD performance.
Read moreEStream: Online Mining of Frequent Sets with Precise Error Guarantee
In data stream applications, a good approximation obtained in a timely manner is often better than the exact answer that’s delayed beyond the window of opportunity. Of course, the quality of the approximate is as important as its timely delivery. Unfortunately, algorithms capable of online processing do not conform strictly to a precise error guarantee. Since online processing is essential and so is the precision of the error, it is necessary that stream algorithms meet both criteria. Yet, this is not the case for mining frequent sets in data streams. We present EStream, a novel algorithm that allows online processing while producing results strictly within the error bound. Our theoretical and experimental results show that EStream is a better candidate for finding frequent sets in data streams, when both constraints need to be satisfied.
Read more