scientific article; zbMATH DE number 5016624

MaRDI QIDQ3378231zbMATH OpenFDO

Authors Aurel Cami, Narsingh Deo

Publication date 30 March 2006

zbMATH Keywords

greedy best-first search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A community mining algorithm based on core nodes expansion
• A greedy algorithm for neighborhood overlap-based community detection
• An efficient community detection algorithm using greedy surprise maximization
• Community detection in networks via a spectral heuristic based on the clustering coefficient
• A community detection algorithm based on cover
• A graph clustering algorithm based on a clustering coefficient for weighted graphs

Cited in

(2)

• Decentralized mining social network communities with agents
• A community mining algorithm based on core nodes expansion

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378231)