Sciweavers

1187 search results - page 196 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ALT
2003
Springer
15 years 1 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
IJCAI
1993
14 years 11 months ago
Action Representation and Purpose: Re-evaluating the Foundations of Computational Vision
The traditional goal of computer vision, to reconstruct, or recover properties of, the scene has recently been challenged by advocates of a new purposive approach in which the vis...
Michael J. Black, Yiannis Aloimonos, Christopher M...
EOR
2007
100views more  EOR 2007»
14 years 9 months ago
Parallel radial basis function methods for the global optimization of expensive functions
We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...
Rommel G. Regis, Christine A. Shoemaker
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
13 years 4 days ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...