Sciweavers

2277 search results - page 110 / 456
» Clustering by pattern similarity in large data sets
Sort
View
IAAI
2003
15 years 7 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
VLDB
1999
ACM
224views Database» more  VLDB 1999»
15 years 10 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
CIKM
2008
Springer
15 years 8 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
VLDB
2002
ACM
114views Database» more  VLDB 2002»
15 years 6 months ago
Tree Pattern Aggregation for Scalable XML Data Dissemination
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...
Chee Yong Chan, Wenfei Fan, Pascal Felber, Minos N...
ICDIM
2010
IEEE
15 years 4 months ago
Data mining and automatic OLAP schema generation
Data mining aims at extraction of previously unidentified information from large databases. It can be viewed as an automated application of algorithms to discover hidden patterns a...
Muhammad Usman, Sohail Asghar, Simon Fong