Sciweavers

573 search results - page 32 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
14 years 8 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
DAWAK
2004
Springer
13 years 11 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
14 years 8 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 2 months ago
Cross-Mining Binary and Numerical Attributes
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Sep...
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 7 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen