Sciweavers

432 search results - page 72 / 87
» Set-Oriented Mining for Association Rules in Relational Data...
Sort
View
AUSAI
2003
Springer
15 years 5 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
VLDB
2002
ACM
91views Database» more  VLDB 2002»
14 years 11 months ago
DTD-Directed Publishing with Attribute Translation Grammars
We present a framework for publishing relational data in XML with respect to a fixed DTD. In data exchange on the Web, XML views of relational data are typically required to confo...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Raje...
IDEAS
1999
IEEE
175views Database» more  IDEAS 1999»
15 years 4 months ago
A Parallel Scalable Infrastructure for OLAP and Data Mining
Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health-care among many others. The mu...
Sanjay Goil, Alok N. Choudhary
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
14 years 12 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 5 days ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen