Sciweavers

716 search results - page 78 / 144
» Mining Association Rules from Relational Data - Average Dist...
Sort
View
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 8 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
ADVIS
2004
Springer
14 years 1 months ago
Multiple Sets of Rules for Text Categorization
An important issue in text mining is how to make use of multiple pieces knowledge discovered to improve future decisions. In this paper, we propose a new approach to combining mult...
Yaxin Bi, Terry J. Anderson, Sally I. McClean
CORR
2010
Springer
193views Education» more  CORR 2010»
13 years 6 months ago
A Probabilistic Approach for Learning Folksonomies from Structured Data
Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach t...
Anon Plangprasopchok, Kristina Lerman, Lise Getoor
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 6 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
14 years 5 days ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth