Sciweavers

464 search results - page 45 / 93
» Frequent pattern mining for kernel trace data
Sort
View
SDM
2012
SIAM
293views Data Mining» more  SDM 2012»
13 years 3 months ago
RP-growth: Top-k Mining of Relevant Patterns with Minimum Support Raising
One practical inconvenience in frequent pattern mining is that it often yields a flood of common or uninformative patterns, and thus we should carefully adjust the minimum suppor...
Yoshitaka Kameya, Taisuke Sato
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
15 years 7 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
CIB
2004
57views more  CIB 2004»
15 years 1 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...
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
16 years 1 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 6 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen