Sciweavers

104 search results - page 6 / 21
» Iterative Subgraph Mining for Principal Component Analysis
Sort
View
ADBIS
2003
Springer
108views Database» more  ADBIS 2003»
14 years 24 days ago
Dynamic Integration of Classifiers in the Space of Principal Components
Recent research has shown the integration of multiple classifiers to be one of the most important directions in machine learning and data mining. It was shown that, for an ensemble...
Alexey Tsymbal, Mykola Pechenizkiy, Seppo Puuronen...
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 7 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
NIPS
2003
13 years 9 months ago
Extreme Components Analysis
Principal components analysis (PCA) is one of the most widely used techniques in machine learning and data mining. Minor components analysis (MCA) is less well known, but can also...
Max Welling, Felix V. Agakov, Christopher K. I. Wi...
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 3 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 4 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...