Sciweavers

1314 search results - page 78 / 263
» Approximate data mining in very large relational data
Sort
View
ICDM
2003
IEEE
210views Data Mining» more  ICDM 2003»
15 years 7 months ago
CBC: Clustering Based Text Classification Requiring Minimal Labeled Data
Semi-supervised learning methods construct classifiers using both labeled and unlabeled training data samples. While unlabeled data samples can help to improve the accuracy of trai...
Hua-Jun Zeng, Xuanhui Wang, Zheng Chen, Hongjun Lu...
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
15 years 5 months ago
Preserving Privacy through Data Generation
Many databases will not or can not be disclosed without strong guarantees that no sensitive information can be extracted. To address this concern several data perturbation techniq...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
CIKM
2010
Springer
15 years 8 days 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
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
15 years 7 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
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 2 months ago
Mining for misconfigured machines in grid systems
Grid systems are proving increasingly useful for managing the batch computing jobs of organizations. One well known example for that is Intel which uses an internally developed sy...
Noam Palatin, Arie Leizarowitz, Assaf Schuster, Ra...