1314 search results - page 4 / 263 » Approximate data mining in very large relational data |
SBACPAD
2003
IEEE
14 years 19 days ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
VLDB
1999
ACM
13 years 11 months ago
1999
ACM
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
EDBT
2002
ACM
14 years 7 months ago
2002
ACM
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
ICDM
2003
IEEE
14 years 19 days ago
2003
IEEE
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...