499 search results - page 40 / 100 » A Search Algorithm for Clusters in a Network or Graph |
AUSAI
2004
Springer
14 years 1 months ago
2004
Springer
The K-means Fast Learning Artificial Neural Network (KFLANN) is a small neural network bearing two types of parameters, the tolerance, δ and the vigilance, µ. In previous papers,...
HIPC
2007
Springer
14 years 1 months ago
2007
Springer
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we present a Gen...
31
Voted
KAIS
2011
13 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
APVIS
2009
13 years 8 months ago
2009
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...