Sciweavers

1701 search results - page 200 / 341
» Providing k-anonymity in data mining
Sort
View
77
Voted
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
15 years 4 months ago
Projective Clustering Ensembles
Recent advances in data clustering concern clustering ensembles and projective clustering methods, each addressing different issues in clustering problems. In this paper, we consi...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
15 years 4 months ago
Clustering Events on Streams Using Complex Context Information
Monitoring applications play an increasingly important role in many domains. They detect events in monitored systems and take actions such as invoke a program or notify an adminis...
YongChul Kwon, Wing Yee Lee, Magdalena Balazinska,...
AUSDM
2007
Springer
100views Data Mining» more  AUSDM 2007»
15 years 4 months ago
Predictive Model of Insolvency Risk for Australian Corporations
This paper describes the development of a predictive model for corporate insolvency risk in Australia. The model building methodology is empirical with out-ofsample future year te...
Rohan A. Baxter, Mark Gawler, Russell Ang
ICDM
2005
IEEE
109views Data Mining» more  ICDM 2005»
15 years 3 months ago
Triple Jump Acceleration for the EM Algorithm
This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on th...
Han-Shen Huang, Bou-Ho Yang, Chun-Nan Hsu
SDM
2010
SIAM
149views Data Mining» more  SDM 2010»
14 years 11 months ago
Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization
Real-world relational data are seldom stationary, yet traditional collaborative filtering algorithms generally rely on this assumption. Motivated by our sales prediction problem, ...
Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff Schneide...