We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the -means cost; our local moves are tree...
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...
Motion repulsion is the perceived enlargement of the angle between the directions of motion of two transparently moving patterns. An explanation of this illusion has long been soug...
Alireza S. Mahani, Anders E. Carlsson, Ralf Wessel
Multicluster architectures overcome the scaling problem of centralized resources by distributing the datapath, register file, and memory subsystem across multiple clusters connec...
– Clustering is an important task in spatial data mining and spatial analysis. We propose a clustering algorithm P-DBSCAN to cluster polygons in space. PDBSCAN is based on the we...