Sciweavers

4039 search results - page 412 / 808
» A Method for Dynamic Clustering of Data
Sort
View
CVPR
2007
IEEE
16 years 1 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 7 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 1 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
FLAIRS
2004
15 years 8 months ago
A Method Based on RBF-DDA Neural Networks for Improving Novelty Detection in Time Series
Novelty detection in time series is an important problem with application in different domains such as machine failure detection, fraud detection and auditing. An approach to this...
Adriano L. I. Oliveira, Fernando Buarque de Lima N...
BMCBI
2010
85views more  BMCBI 2010»
15 years 7 months ago
Robust test method for time-course microarray experiments
Background: In a time-course microarray experiment, the expression level for each gene is observed across a number of time-points in order to characterize the temporal trajectorie...
Insuk Sohn, Kouros Owzar, Stephen L. George, Sujon...