Sciweavers

119 search results - page 20 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
ICPP
2000
IEEE
13 years 11 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
BMCBI
2007
215views more  BMCBI 2007»
13 years 7 months ago
Learning causal networks from systems biology time course data: an effective model selection procedure for the vector autoregres
Background: Causal networks based on the vector autoregressive (VAR) process are a promising statistical tool for modeling regulatory interactions in a cell. However, learning the...
Rainer Opgen-Rhein, Korbinian Strimmer
BMCBI
2008
171views more  BMCBI 2008»
13 years 7 months ago
A general approach to simultaneous model fitting and variable elimination in response models for biological data with many more
Background: With the advent of high throughput biotechnology data acquisition platforms such as micro arrays, SNP chips and mass spectrometers, data sets with many more variables ...
Harri T. Kiiveri
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 25 days ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
ICML
2007
IEEE
14 years 8 months ago
Multiclass multiple kernel learning
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
Alexander Zien, Cheng Soon Ong