Sciweavers

1768 search results - page 98 / 354
» Mining Very Large Databases
Sort
View
IPPS
1998
IEEE
15 years 2 months ago
High Performance Data Mining Using Data Cubes on Parallel Computers
On-Line Analytical Processing techniques are used for data analysis and decision support systems. The multidimensionality of the underlying data is well represented by multidimens...
Sanjay Goil, Alok N. Choudhary
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
15 years 11 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
DASFAA
2005
IEEE
137views Database» more  DASFAA 2005»
15 years 3 months ago
A General Approach to Mining Quality Pattern-Based Clusters from Microarray Data
Abstract. Pattern-based clustering has broad applications in microarray data analysis, customer segmentation, e-business data analysis, etc. However, pattern-based clustering often...
Daxin Jiang, Jian Pei, Aidong Zhang
IDEAL
2003
Springer
15 years 3 months ago
Experiences of Using a Quantitative Approach for Mining Association Rules
In recent years interest has grown in “mining” large databases to extract novel and interesting information. Knowledge Discovery in Databases (KDD) has been recognised as an em...
L. Dong, Christos Tjortjis
JCP
2008
171views more  JCP 2008»
14 years 9 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen