Sciweavers

4009 search results - page 265 / 802
» Clustering on Complex Graphs
Sort
View
165
Voted
AAAI
2007
15 years 8 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
ACL
1998
15 years 7 months ago
Terminological Variation, a Means of Identifying Research Topics from Texts
After extracting terms from a corpus of titles and s in English, syntactic variation relations are identified amongst them in order to detect research topics. Three types of synta...
Fidelia Ibekwe-Sanjuan
153
Voted
ICASSP
2010
IEEE
15 years 5 months ago
Towards multi-speaker unsupervised speech pattern discovery
In this paper, we explore the use of a Gaussian posteriorgram based representation for unsupervised discovery of speech patterns. Compared with our previous work, the new approach...
Yaodong Zhang, James R. Glass
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 6 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
15 years 11 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...