Sciweavers

111 search results - page 16 / 23
» COFI approach for mining frequent itemsets revisited
Sort
View
90
Voted
KDID
2004
132views Database» more  KDID 2004»
14 years 11 months ago
An Automata Approach to Pattern Collections
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
CIKM
2009
Springer
15 years 2 months ago
A novel approach for privacy mining of generic basic association rules
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
CORR
2008
Springer
114views Education» more  CORR 2008»
14 years 9 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
CIKM
2006
Springer
15 years 1 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
DATAMINE
1999
152views more  DATAMINE 1999»
14 years 9 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