Sciweavers

917 search results - page 71 / 184
» Mining interesting sets and rules in relational databases
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 9 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
SIGMOD
2000
ACM
212views Database» more  SIGMOD 2000»
14 years 1 months ago
SQLEM: Fast Clustering in SQL using the EM Algorithm
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...
Carlos Ordonez, Paul Cereghini
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
14 years 9 months ago
Relational learning via latent social dimensions
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
Lei Tang, Huan Liu
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
14 years 19 days ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 9 months ago
V-Miner: using enhanced parallel coordinates to mine product design and test data
Analyzing data to find trends, correlations, and stable patterns is an important task in many industrial applications. This paper proposes a new technique based on parallel coordi...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Andreas Sc...