Sciweavers

4039 search results - page 172 / 808
» A Method for Dynamic Clustering of Data
Sort
View
APWEB
2005
Springer
15 years 10 months ago
An LOD Model for Graph Visualization and Its Application in Web Navigation
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
Shixia Liu, Yue Pan, Liping Yang, Wenyin Liu
BMCBI
2010
152views more  BMCBI 2010»
15 years 5 months ago
Comparative study of discretization methods of microarray data for inferring transcriptional regulatory networks
Background: Microarray data discretization is a basic preprocess for many algorithms of gene regulatory network inference. Some common discretization methods in informatics are us...
Yong Li, Lili Liu, Xi Bai, Hua Cai, Wei Ji, Dianji...
132
Voted
COLT
2005
Springer
15 years 10 months ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed ā€œmanifold-motivatedā€...
Mikhail Belkin, Partha Niyogi
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
15 years 2 months ago
Dynamic path planning with multi-agent data fusion - The Parallel Hierarchical Replanner
The design of a hierarchical planning system in which each level operates in parallel and communicates asynchronously is presented. It is shown that this Parallel Hierarchical Repl...
Thomas Allen, Andrew Hill, James Patrick Underwood...
ICML
2009
IEEE
15 years 11 months ago
Fast evolutionary maximum margin clustering
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
Fabian Gieseke, Tapio Pahikkala, Oliver Kramer