Sciweavers

446 search results - page 48 / 90
» Randomization in Privacy-Preserving Data Mining
Sort
View
ICDM
2009
IEEE
199views Data Mining» more  ICDM 2009»
14 years 4 months ago
Active Learning with Adaptive Heterogeneous Ensembles
—One common approach to active learning is to iteratively train a single classifier by choosing data points based on its uncertainty, but it is nontrivial to design uncertainty ...
Zhenyu Lu, Xindong Wu, Josh Bongard
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
14 years 4 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
14 years 2 months ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
DBSEC
2001
115views Database» more  DBSEC 2001»
13 years 11 months ago
Randomly roving agents for intrusion detection
Agent based intrusion detection systems IDS have advantages such as scalability, recon gurability, and survivability. In this paper, we introduce a mobile-agent based IDS, called ...
Ira S. Moskowitz, Myong H. Kang, LiWu Chang, Garth...