Sciweavers

243 search results - page 29 / 49
» Scalable mining of large disk-based graph databases
Sort
View
SIGMOD
1998
ACM
233views Database» more  SIGMOD 1998»
13 years 11 months ago
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopul...
EUROPAR
2001
Springer
14 years 1 days ago
Parallel Tree Projection Algorithm for Sequence Mining
Discovery of sequential patterns is becoming increasingly useful and essential in many scienti c and commercial domains. Enormous sizes of available datasets and possibly large nu...
Valerie Guralnik, Nivea Garg, George Karypis
DOLAP
2010
ACM
13 years 5 months ago
Relational versus non-relational database systems for data warehousing
Relational database systems have been the dominating technology to manage and analyze large data warehouses. Moreover, the ER model, the standard in database design, has a close r...
Carlos Ordonez, Il-Yeol Song, Carlos Garcia-Alvara...
VIS
2005
IEEE
122views Visualization» more  VIS 2005»
14 years 8 months ago
Effectively Visualizing Large Networks Through Sampling
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
Davood Rafiei, Stephen Curial
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 7 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han