Sciweavers

138 search results - page 16 / 28
» Divide-and-Conquer Strategies for Process Mining
Sort
View
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
14 years 8 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
WWW
2007
ACM
14 years 8 months ago
Mirror site maintenance based on evolution associations of web directories
Mirroring Web sites is a well-known technique commonly used in the Web community. A mirror site should be updated frequently to ensure that it reflects the content of the original...
Ling Chen 0002, Sourav S. Bhowmick, Wolfgang Nejdl
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
14 years 2 months ago
Stream Sequential Pattern Mining with Precise Error Bounds
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
Luiz F. Mendes, Bolin Ding, Jiawei Han
KDD
2002
ACM
115views Data Mining» more  KDD 2002»
14 years 8 months ago
Collaborative crawling: mining user experiences for topical resource discovery
The rapid growth of the world wide web had made the problem of topic speci c resource discovery an important one in recent years. In this problem, it is desired to nd web pages wh...
Charu C. Aggarwal
ICDM
2008
IEEE
141views Data Mining» more  ICDM 2008»
14 years 2 months ago
Scalable Tensor Decompositions for Multi-aspect Data Mining
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensiona...
Tamara G. Kolda, Jimeng Sun