Sciweavers

3142 search results - page 116 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
16 years 3 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
AAAI
2006
15 years 4 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
134
Voted
SYSTOR
2009
ACM
15 years 9 months ago
DHIS: discriminating hierarchical storage
A typical storage hierarchy comprises of components with varying performance and cost characteristics, providing multiple options for data placement. We propose and evaluate a hie...
Chaitanya Yalamanchili, Kiron Vijayasankar, Erez Z...
IDA
2009
Springer
15 years 29 days ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis
EMMCVPR
2001
Springer
15 years 7 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...