A maximum entropy approach to natural language processing
Computational Linguistics
Combining labeled and unlabeled data with co-training
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Analyzing the effectiveness and applicability of co-training
Proceedings of the ninth international conference on Information and knowledge management
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Transductive Inference for Text Classification using Support Vector Machines
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
CAEP: Classification by Aggregating Emerging Patterns
DS '99 Proceedings of the Second International Conference on Discovery Science
Stuff I've seen: a system for personal information retrieval and re-use
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
MMAC: A New Multi-Class, Multi-Label Associative Classification Approach
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Mining top-K covering rule groups for gene expression data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Summarizing itemset patterns: a profile-based approach
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
IEEE Transactions on Knowledge and Data Engineering
Generating semantic annotations for frequent patterns with context analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Lazy Associative Classification
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
A greedy classification algorithm based on association rule
Applied Soft Computing
A review of associative classification mining
The Knowledge Engineering Review
Direct mining of discriminative and essential frequent patterns via model-based search tree
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient frequent pattern mining over data streams
Proceedings of the 17th ACM conference on Information and knowledge management
Blind paraunitary equalization
Signal Processing
Post-processing of associative classification rules using closed sets
Expert Systems with Applications: An International Journal
Associative classification of mammograms using weighted rules
Expert Systems with Applications: An International Journal
The WEKA data mining software: an update
ACM SIGKDD Explorations Newsletter
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
As a branch of classification, associative classification combines the basic ideas of association rule mining and general classification. Previous studies show that associative classification can achieve a higher classification accuracy comparing with traditional classification methods, such as C4.5. It is known that new frequent patterns may emerge from the classified resources during classification, and these newly emerging frequent patterns can be used to build new classification rules. However, this dynamic characteristics in associative classification has not been well reflected in traditional methods. In this paper, we propose an enhanced associative classification method by integrating the dynamic property in the process of associative classification. In the proposed method, we employ co-training to refine the discovered emerging frequent patterns for classification rule extension and utilize the maximum entropy model for class label prediction. The empirical study shows that our method can be used to classify increasing resources efficiently and effectively.