Sciweavers

1701 search results - page 84 / 341
» Providing k-anonymity in data mining
Sort
View
SDM
2009
SIAM
343views Data Mining» more  SDM 2009»
15 years 7 months ago
Change-Point Detection in Time-Series Data by Direct Density-Ratio Estimation.
Change-point detection is the problem of discovering time points at which properties of time-series data change. This covers a broad range of real-world problems and has been acti...
Masashi Sugiyama, Yoshinobu Kawahara
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
15 years 2 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
SIGMOD
2005
ACM
150views Database» more  SIGMOD 2005»
15 years 10 months ago
BRAID: Stream Mining through Group Lag Correlations
The goal is to monitor multiple numerical streams, and determine which pairs are correlated with lags, as well as the value of each such lag. Lag correlations (and anticorrelation...
Yasushi Sakurai, Spiros Papadimitriou, Christos Fa...
BTW
2009
Springer
240views Database» more  BTW 2009»
14 years 11 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent
BDIM
2008
IEEE
205views Business» more  BDIM 2008»
15 years 4 months ago
Mining semantic relations using NetFlow
—Knowing the dependencies among computing assets and services provides insights into the computing and business landscape, therefore, facilitating low-risk timely changes in supp...
Alexandru Caracas, Andreas Kind, Dieter Gantenbein...