694 search results - page 38 / 139 » On the Dimensions of Data Complexity through Synthetic Data ... |
SDM
2010
SIAM
15 years 1 months ago
2010
SIAM
We give a permutation approach to validation (estimation of out-sample error). One typical use of validation is model selection. We establish the legitimacy of the proposed permut...
PR
2007
14 years 11 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
138
click to vote
PKDD
2004
Springer
15 years 5 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
AIIA
2005
Springer
15 years 5 months ago
2005
Springer
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
142
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...