Sciweavers

1701 search results - page 265 / 341
» Providing k-anonymity in data mining
Sort
View
KDD
2010
ACM
270views Data Mining» more  KDD 2010»
13 years 12 months ago
An energy-efficient mobile recommender system
The increasing availability of large-scale location traces creates unprecedent opportunities to change the paradigm for knowledge discovery in transportation systems. A particular...
Yong Ge, Hui Xiong, Alexander Tuzhilin, Keli Xiao,...
GRC
2010
IEEE
13 years 11 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
CIKM
2010
Springer
13 years 8 months ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 10 months ago
Detecting outliers using transduction and statistical testing
Outlier detection can uncover malicious behavior in fields like intrusion detection and fraud analysis. Although there has been a significant amount of work in outlier detection, ...
Daniel Barbará, Carlotta Domeniconi, James ...
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 10 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