Sciweavers

1701 search results - page 146 / 341
» Providing k-anonymity in data mining
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 1 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
13 years 9 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...
ICDM
2008
IEEE
112views Data Mining» more  ICDM 2008»
16 years 1 months ago
A Radar for the Internet
In contrast with most internet topology measurement research, our concern here is not to obtain a map as complete and precise as possible of the whole internet. Instead, we claim ...
Matthieu Latapy, Clémence Magnien, Fr&eacut...
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
16 years 20 days ago
Integrating Features from Different Sources for Music Information Retrieval
Efficient and intelligent music information retrieval is a very important topic of the 21st century. With the ultimate goal of building personal music information retrieval syste...
Tao Li, Mitsunori Ogihara, Shenghuo Zhu
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
16 years 20 days ago
A Maximum Likelihood Approach to Noise Estimation for Intensity Measurements in Biology
Often, measurement of biological components generates results, that are corrupted by noise. Noise can be caused by various factors like the detectors themselves, sample properties...
Frank Klawonn, Claudia Hundertmark, Lothar Jä...