Sciweavers

63 search results - page 7 / 13
» Sample-dependent graph construction with application to dime...
Sort
View
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
14 years 1 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
PRL
2006
121views more  PRL 2006»
13 years 7 months ago
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Data reduction plays an important role in machine learning and pattern recognition with a high-dimensional data. In real-world applications data usually exists with hybrid formats...
Qinghua Hu, Daren Yu, Zongxia Xie
BMCBI
2008
96views more  BMCBI 2008»
13 years 7 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
PR
2010
145views more  PR 2010»
13 years 6 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen
CVPR
2007
IEEE
14 years 9 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor