Sciweavers

688 search results - page 38 / 138
» Reverse Tree Clustering
Sort
View
IJCNN
2000
IEEE
14 years 4 days ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
SPIRE
2004
Springer
14 years 1 months ago
Linear Time Algorithm for the Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 8 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
COMPUTER
1998
131views more  COMPUTER 1998»
13 years 7 months ago
Windows NT Clustering Service
ER ABSTRACTIONS ter service uses several abstractions— including resource, resource dependencies, and resource groups—to simplify both the cluster service itself and user-visib...
Rod Gamache, Rob Short, Mike Massa
GD
2004
Springer
14 years 1 months ago
Clustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...