Sciweavers

3130 search results - page 418 / 626
» Mining Views: Database Views for Data Mining
Sort
View
PODS
2008
ACM
211views Database» more  PODS 2008»
16 years 6 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
SAC
1997
ACM
15 years 10 months ago
The RasDaMan approach to multidimensional database management
Multidimensional discrete data (MDD), i.e., arrays of arbitrary size, dimension, and base type, are receiving growing attention among the database community. MDD occur in a variet...
Peter Baumann, Paula Furtado, Roland Ritsch, Norbe...
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
16 years 3 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
PKDD
2009
Springer
148views Data Mining» more  PKDD 2009»
16 years 21 days ago
Feature Selection by Transfer Learning with Linear Regularized Models
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
Thibault Helleputte, Pierre Dupont
PAKDD
2004
ACM
83views Data Mining» more  PAKDD 2004»
15 years 11 months ago
Providing Diversity in K-Nearest Neighbor Query Results
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...
Anoop Jain, Parag Sarda, Jayant R. Haritsa