Sciweavers

4085 search results - page 313 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ICDM
2003
IEEE
101views Data Mining» more  ICDM 2003»
15 years 9 months ago
Interactive Visualization and Navigation in Large Data Collections using the Hyperbolic Space
We propose the combination of two recently introduced methods for the interactive visual data mining of large collections of data. Both, Hyperbolic Multi-Dimensional Scaling (HMDS...
Jörg A. Walter, Jörg Ontrup, Daniel Wess...
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
16 years 4 months ago
Febrl -: an open source data cleaning, deduplication and record linkage system with a graphical user interface
Matching records that refer to the same entity across databases is becoming an increasingly important part of many data mining projects, as often data from multiple sources needs ...
Peter Christen
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
15 years 11 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...
PAKDD
2007
ACM
143views Data Mining» more  PAKDD 2007»
15 years 10 months ago
Clustering Ensembles Based on Normalized Edges
The co-association (CA) matrix was previously introduced to combine multiple partitions. In this paper, we analyze the CA matrix, and address its difference from the similarity ma...
Yan Li, Jian Yu, Pengwei Hao, Zhulin Li
PAKDD
2005
ACM
168views Data Mining» more  PAKDD 2005»
15 years 9 months ago
Adaptive Nonlinear Auto-Associative Modeling Through Manifold Learning
We propose adaptive nonlinear auto-associative modeling (ANAM) based on Locally Linear Embedding algorithm (LLE) for learning intrinsic principal features of each concept separatel...
Junping Zhang, Stan Z. Li