Sciweavers

1413 search results - page 57 / 283
» Mining Multiple Large Databases
Sort
View
ICSM
1998
IEEE
13 years 12 months ago
Identification of Data Cohesive Subsystems Using Data Mining Techniques
The activity of reengineering and maintaining large legacy systems involves the use of design recovery es to produce abstractions that facilitate the understanding of the system. ...
Carlos Montes de Oca, Doris L. Carver
IDEAL
2004
Springer
14 years 1 months ago
PRICES: An Efficient Algorithm for Mining Association Rules
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...
Chuan Wang, Christos Tjortjis
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 8 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
WLP
2004
Springer
14 years 1 months ago
SQL Based Frequent Pattern Mining with FP-Growth
Scalable data mining in large databases is one of today’s real challenges to database research area. The integration of data mining with database systems is an essential componen...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
SIGMOD
2005
ACM
111views Database» more  SIGMOD 2005»
14 years 7 months ago
Efficient Computation of Multiple Group By Queries
Data analysts need to understand the quality of data in the warehouse. This is often done by issuing many Group By queries on the sets of columns of interest. Since the volume of ...
Zhimin Chen, Vivek R. Narasayya