Sciweavers

17688 search results - page 130 / 3538
» Data Set Balancing
Sort
View
CSDA
2007
264views more  CSDA 2007»
15 years 4 months ago
Model-based methods to identify multiple cluster structures in a data set
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
Giuliano Galimberti, Gabriele Soffritti
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
15 years 10 months ago
Privacy-Preserving k-NN for Small and Large Data Sets
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
Artak Amirbekyan, Vladimir Estivill-Castro
IDEAL
2003
Springer
15 years 9 months ago
Association Rule Mining Algorithms for Set-Valued Data
This paper presents an association rule mining system that is capable of handling set-valued attributes. Our previous research has exposed us to a variety of real-world biological ...
Christopher A. Shoemaker, Carolina Ruiz
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
16 years 5 months ago
Cost-Conscious Cleaning of Massive RFID Data Sets
Efficient and accurate data cleaning is an essential task for the successful deployment of RFID systems. Although important advances have been made in tag detection rates, it is s...
Hector Gonzalez, Jiawei Han, Xuehua Shen
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
15 years 11 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...