Search For:

Displaying 1-3 out of 3 total
A Revised Ant Clustering Algorithm with Obstacle Constraints
Found in: Computer Science and Information Engineering, World Congress on
By Jianhua Qu, Xiyu Liu
Issue Date:April 2009
pp. 679-683
Clustering of spatial data in the presence of obstacles has a wide application. It is an important research topic in the spatial data mining. This paper discusses the problem of spatial clustering with obstacles constraints and presents a revised method na...
 
A Quick Ant Clustering Algorithm
Found in: Fuzzy Systems and Knowledge Discovery, Fourth International Conference on
By Jianhua Qu, Xiyu Liu
Issue Date:August 2007
pp. 722-725
No summary available.
 
PSOGD: A new method for graph drawing
Found in: 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)
By Jianhua Qu,Yi Song,Stephane Bressan
Issue Date:April 2013
pp. 229-235
Force-directed graph drawing algorithms compute a layout as the equilibrium of a physical system. This equilibrium is an optimum of the corresponding objective function. We propose a new method for drawing undirected graphs that uses particle swarm optimiz...
   
 1