232 search results - page 11 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
DASFAA
2007
IEEE
14 years 1 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
ICANN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
EMMCVPR
2001
Springer
13 years 11 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
AI
2006
Springer
13 years 6 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
DIS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...