Sciweavers

9888 search results - page 1859 / 1978
» compute 2009
Sort
View
117
Voted
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
15 years 10 months ago
Hierarchical Linear Discriminant Analysis for Beamforming.
This paper demonstrates the applicability of the recently proposed supervised dimension reduction, hierarchical linear discriminant analysis (h-LDA) to a well-known spatial locali...
Barry L. Drake, Haesun Park, Jaegul Choo
106
Voted
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
15 years 10 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 10 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
SDM
2009
SIAM
192views Data Mining» more  SDM 2009»
15 years 10 months ago
Mining Cohesive Patterns from Graphs with Feature Vectors.
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...
106
Voted
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
15 years 10 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
« Prev « First page 1859 / 1978 Last » Next »