Sciweavers

229 search results - page 33 / 46
» dmFSQL: a Server for Data Mining
Sort
View
ASPLOS
1998
ACM
15 years 1 months ago
A Cost-Effective, High-Bandwidth Storage Architecture
This paper describes the Network-Attached Secure Disk (NASD) storage architecture, prototype implementations of NASD drives, array management for our architecture, and three files...
Garth A. Gibson, David Nagle, Khalil Amiri, Jeff B...
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
14 years 9 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
BMCBI
2005
180views more  BMCBI 2005»
14 years 9 months ago
arrayCGHbase: an analysis platform for comparative genomic hybridization microarrays
Background: The availability of the human genome sequence as well as the large number of physically accessible oligonucleotides, cDNA, and BAC clones across the entire genome has ...
Björn Menten, Filip Pattyn, Katleen De Preter...
ICICS
2005
Springer
15 years 3 months ago
Private Itemset Support Counting
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
15 years 10 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...