Sciweavers

35 search results - page 3 / 7
» A new classification of datasets for frequent itemsets
Sort
View
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
13 years 10 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
CIDM
2007
IEEE
14 years 3 days ago
Measuring the Validity of Document Relations Discovered from Frequent Itemset Mining
— The extension approach of frequent itemset mining can be applied to discover the relations among documents. Several schemes, i.e., n-gram, stemming, stopword removal and term w...
Kritsada Sriphaew, Thanaruk Theeramunkong
DSS
2006
129views more  DSS 2006»
13 years 5 months ago
A new approach to classification based on association rule mining
Classification is one of the key issues in the fields of decision sciences and knowledge discovery. This paper presents a new approach for constructing a classifier, based on an e...
Guoqing Chen, Hongyan Liu, Lan Yu, Qiang Wei, Xing...
AUSAI
2001
Springer
13 years 9 months ago
Further Pruning for Efficient Association Rule Discovery
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
Songmao Zhang, Geoffrey I. Webb
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
13 years 11 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender