Sciweavers

739 search results - page 143 / 148
» Approximate Association Rule Mining
Sort
View
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
11 years 10 months ago
Transparent user models for personalization
Personalization is a ubiquitous phenomenon in our daily online experience. While such technology is critical for helping us combat the overload of information we face, in many cas...
Khalid El-Arini, Ulrich Paquet, Ralf Herbrich, Jur...
DIS
2006
Springer
13 years 11 months ago
Visual Interactive Subgroup Discovery with Numerical Properties of Interest
Abstract. We propose an approach to subgroup discovery using distribution rules (a kind of association rules with a probability distribution on the consequent) for numerical proper...
Alípio Mário Jorge, Fernando Pereira...
BMCBI
2008
173views more  BMCBI 2008»
13 years 7 months ago
Improved machine learning method for analysis of gas phase chemistry of peptides
Background: Accurate peptide identification is important to high-throughput proteomics analyses that use mass spectrometry. Search programs compare fragmentation spectra (MS/MS) o...
Allison Gehrke, Shaojun Sun, Lukasz A. Kurgan, Nat...
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
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal