Sciweavers

90 search results - page 8 / 18
» Constraint programming for itemset mining
Sort
View
104
Voted
PAKDD
2007
ACM
166views Data Mining» more  PAKDD 2007»
15 years 6 months ago
gPrune: A Constraint Pushing Framework for Graph Pattern Mining
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
ACIIDS
2009
IEEE
162views Database» more  ACIIDS 2009»
15 years 5 months ago
Deriving Conceptual Schema from XML Databases
In this paper, two concepts from different research areas are addressed together, namely functional dependency (FD) and multidimensional association rule (MAR). FD is a class of i...
Oviliani Yenty Yuliana, Suphamit Chittayasothorn
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 4 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
14 years 3 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 5 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu