7150 search results - page 680 / 1430 » Graph-Based Data Mining |
204
Voted
ADBIS
2006
Springer
16 years 1 months ago
2006
Springer
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
177
click to vote
PAKDD
2005
ACM
16 years 23 days ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
199
click to vote
ICDM
2002
IEEE
16 years 7 days ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
199
click to vote
PAKDD
2009
ACM
15 years 12 months ago
2009
ACM
Detecting outliers which are grossly different from or inconsistent with the remaining dataset is a major challenge in real-world KDD applications. Existing outlier detection met...
225
click to vote
RSFDGRC
1999
Springer
15 years 11 months ago
1999
Springer
: In real-life data, in general, many attribute values are missing. Therefore, rule induction requires preprocessing, where missing attribute values are replaced by appropriate val...