Sciweavers

302 search results - page 35 / 61
» Efficient frequent pattern mining over data streams
Sort
View
81
Voted
PVLDB
2008
107views more  PVLDB 2008»
14 years 9 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
CIB
2004
57views more  CIB 2004»
14 years 9 months ago
Identifying Global Exceptional Patterns in Multi-database Mining
In multi-database mining, there can be many local patterns (frequent itemsets or association rules) in each database. At the end of multi-database mining, it is necessary to analyz...
Chengqi Zhang, Meiling Liu, Wenlong Nie, Shichao Z...
75
Voted
KDD
2003
ACM
135views Data Mining» more  KDD 2003»
15 years 10 months ago
Efficiently handling feature redundancy in high-dimensional data
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
Lei Yu, Huan Liu
ASC
2008
14 years 9 months ago
Info-fuzzy algorithms for mining dynamic data streams
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
Lior Cohen, Gil Avrahami, Mark Last, Abraham Kande...
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
15 years 3 months ago
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
Alva Erwin, Raj P. Gopalan, N. R. Achuthan