728 search results - page 12 / 146 » Mining for Empty Rectangles in Large Data Sets |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...