Sciweavers

252 search results - page 23 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 5 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
14 years 5 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
IJAR
2011
118views more  IJAR 2011»
12 years 11 months ago
A sequential pattern mining algorithm using rough set theory
Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns in time se...
Ken Kaneiwa, Yasuo Kudo
ICDE
2005
IEEE
176views Database» more  ICDE 2005»
14 years 1 months ago
LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern
Sequence pattern mining is an important research problem because it is the basis of many other applications. Yet how to efficiently implement the mining is difficult due to the ...
Zhenglu Yang, Masaru Kitsuregawa
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 2 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...