Sciweavers

2932 search results - page 145 / 587
» Higher order mining
Sort
View
KDD
2003
ACM
148views Data Mining» more  KDD 2003»
16 years 6 months ago
Mining data records in Web pages
A large amount of information on the Web is contained in regularly structured objects, which we call data records. Such data records are important because they often present the e...
Bing Liu, Robert L. Grossman, Yanhong Zhai
DASFAA
2007
IEEE
220views Database» more  DASFAA 2007»
16 years 14 days ago
LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases
Sequential pattern mining is very important because it is the basis of many applications. Although there has been a great deal of effort on sequential pattern mining in recent year...
Zhenglu Yang, Yitong Wang, Masaru Kitsuregawa
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
15 years 11 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
190
Voted
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
15 years 11 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
15 years 11 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong