Sciweavers

1314 search results - page 23 / 263
» Approximate data mining in very large relational data
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 7 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 7 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
ICDM2
2004
Springer
196views Data Mining» more  ICDM2 2004»
14 years 23 days ago
An Early Warning System for Vehicle Related Quality Data
Vehicle production audit tests, warranty claims and car control unit data are stored in a central data warehouse for data mining analysis. Neural network based part failure rate es...
Matthias Grabert, Markus Prechtel, Tomas Hrycej, W...
AUSDM
2006
Springer
124views Data Mining» more  AUSDM 2006»
13 years 11 months ago
Analyzing Harmonic Monitoring Data Using Data Mining
Harmonic monitoring has become an important tool for harmonic management in distribution systems. A comprehensive harmonic monitoring program has been designed and implemented on ...
Ali Asheibi, David Stirling, Danny Soetanto
DL
2000
Springer
162views Digital Library» more  DL 2000»
13 years 11 months ago
Snowball: extracting relations from large plain-text collections
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...
Eugene Agichtein, Luis Gravano