Sciweavers

627 search results - page 15 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
BMCBI
2006
165views more  BMCBI 2006»
14 years 11 months ago
Improved variance estimation of classification performance via reduction of bias caused by small sample size
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
Ulrika Wickenberg-Bolin, Hanna Göransson, M&a...
CLUSTER
2003
IEEE
15 years 4 months ago
Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications
This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is ...
Roxana Diaconescu, Reidar Conradi
IJISTA
2008
95views more  IJISTA 2008»
14 years 11 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 2 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 18 days ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum