Sciweavers

567 search results - page 96 / 114
» Decomposing replicable functions
Sort
View
KDD
2007
ACM
160views Data Mining» more  KDD 2007»
14 years 9 months ago
Show me the money!: deriving the pricing power of product features by mining consumer reviews
The increasing pervasiveness of the Internet has dramatically changed the way that consumers shop for goods. Consumergenerated product reviews have become a valuable source of inf...
Nikolay Archak, Anindya Ghose, Panagiotis G. Ipeir...
CVPR
2010
IEEE
14 years 4 months ago
Pareto Discriminant Analysis
Linear Discriminant Analysis (LDA) is a popular tool for multiclass discriminative dimensionality reduction. However, LDA suffers from two major problems: (1) It only optimizes th...
Karim Abou-Moustafa, Fernando De la Torre, Frank F...
ICA
2004
Springer
14 years 1 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
SIGGRAPH
2000
ACM
14 years 25 days ago
As-rigid-as-possible shape interpolation
We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense tha...
Marc Alexa, Daniel Cohen-Or, David Levin
ESAW
2000
Springer
14 years 2 days ago
Models of Coordination
While software is becoming decomposed in more and more finegrained entities, the interactions amongst those become of major importance. While methodologies for building such compon...
Robert Tolksdorf