Sciweavers

879 search results - page 144 / 176
» Forecasting high-dimensional data
Sort
View
CIKM
2009
Springer
15 years 1 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
101
Voted
NIPS
2001
14 years 11 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
CVPR
2007
IEEE
15 years 11 months ago
The Hierarchical Isometric Self-Organizing Map for Manifold Representation
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...
Haiying Guan, Matthew Turk
69
Voted
KDD
2005
ACM
107views Data Mining» more  KDD 2005»
15 years 3 months ago
Predicting the product purchase patterns of corporate customers
This paper describes TIPPPS (Time Interleaved Product Purchase Prediction System), which analyses billing data of corporate customers in a large telecommunications company in orde...
Bhavani Raskutti, Alan Herschtal
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
14 years 11 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...