2119 search results - page 84 / 424 » Structure-Preserving Model Reduction |
184
click to vote
EDBT
2012
ACM
13 years 8 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
196
click to vote
AAAI
2012
13 years 8 months ago
2012
Probabilistic relational PCA (PRPCA) can learn a projection matrix to perform dimensionality reduction for relational data. However, the results learned by PRPCA lack interpretabi...
229
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
241
click to vote
TIP
2010
15 years 26 days ago
2010
We propose a unified manifold learning framework for semi-supervised and unsupervised dimension reduction by employing a simple but effective linear regression function to map the ...
166
click to vote
ICDE
2007
IEEE
16 years 14 days ago
2007
IEEE
Increasingly large text datasets and the high dimensionality associated with natural language create a great challenge in text mining. In this research, a systematic study is cond...