Sciweavers

381 search results - page 47 / 77
» Pattern Directed Mining of Sequence Data
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 8 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
ICDM
2009
IEEE
233views Data Mining» more  ICDM 2009»
14 years 2 months ago
Semi-Supervised Sequence Labeling with Self-Learned Features
—Typical information extraction (IE) systems can be seen as tasks assigning labels to words in a natural language sequence. The performance is restricted by the availability of l...
Yanjun Qi, Pavel Kuksa, Ronan Collobert, Kunihiko ...
DIS
2004
Springer
14 years 1 months ago
Predictive Graph Mining
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
Andreas Karwath, Luc De Raedt
CIKM
2006
Springer
13 years 11 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
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