2137 search results - page 163 / 428 » Experiments on Graph Clustering Algorithms |
125
Voted
ISDA
2006
IEEE
15 years 8 months ago
2006
IEEE
The use of monolithic neural networks (such as a multilayer perceptron) has some drawbacks: e.g. slow learning, weight coupling, the black box effect. These can be alleviated by t...
108
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
143
Voted
COLOGNETWENTE
2010
14 years 11 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
119
Voted
EWCBR
2004
Springer
15 years 7 months ago
2004
Springer
Textual case-based reasoning (TCBR) provides the ability to reason with domain-specific knowledge when experiences exist in text. Ideally, we would like to find an inexpensive way ...
130
click to vote
ESWS
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The original Semantic Web vision was explicit in the need for intelligent autonomous agents that would represent users and help them navigate the Semantic Web. We argue t...