Sciweavers

140 search results - page 28 / 28
» Genetic algorithm-based clustering technique
Sort
View
CVPR
2003
IEEE
14 years 6 months ago
Generalized Principal Component Analysis (GPCA)
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
René Vidal, Shankar Sastry, Yi Ma
WWW
2008
ACM
14 years 5 months ago
Using subspace analysis for event detection from web click-through data
Although most of existing research usually detects events by analyzing the content or structural information of Web documents, a recent direction is to study the usage data. In th...
Ling Chen 0002, Yiqun Hu, Wolfgang Nejdl
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 5 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
BMCBI
2007
153views more  BMCBI 2007»
13 years 5 months ago
An exploration of alternative visualisations of the basic helix-loop-helix protein interaction network
Background: Alternative representations of biochemical networks emphasise different aspects of the data and contribute to the understanding of complex biological systems. In this ...
Brian J. Holden, John W. Pinney, Simon C. Lovell, ...
ISCC
2002
IEEE
122views Communications» more  ISCC 2002»
13 years 9 months ago
Efficiency/friendliness tradeoffs in TCP Westwood
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Bryan K. ...