Sciweavers

4874 search results - page 867 / 975
» Information theory for data management
Sort
View
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
16 years 2 months ago
Predicting prostate cancer recurrence via maximizing the concordance index
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
Lian Yan, David Verbel, Olivier Saidi
98
Voted
KDD
2002
ACM
106views Data Mining» more  KDD 2002»
16 years 2 months ago
Selecting the right interestingness measure for association patterns
Many techniques for association rule mining and feature selection require a suitable metric to capture the dependencies among variables in a data set. For example, metrics such as...
Pang-Ning Tan, Vipin Kumar, Jaideep Srivastava
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
16 years 2 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
SAC
2009
ACM
15 years 8 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
BTW
2003
Springer
118views Database» more  BTW 2003»
15 years 7 months ago
Skalierbare Verarbeitung von XML mit Infonyte-DB
Abstract: The emerging penetration of IT architectures with XML leads to increasing XML data volumes. Available tools often fail in realizing scalable XML processing for large XML ...
Thomas Tesch, Peter Fankhauser, Tim Weitzel