Covering edges by cliques with regard to keyword conflicts and intersection graphs
Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Bipartite structure of all complex networks
Information Processing Letters
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Proceedings of the forty-first annual ACM symposium on Theory of computing
Co-evolution of social and affiliation networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms and Experiments for Clique Relaxations--Finding Maximum s-Plexes
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Operations Research
Combinatorial algorithms for the maximum k-plex problem
Journal of Combinatorial Optimization
Clustering in peer-to-peer file sharing workloads
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
An exact algorithm for the maximum clique problem
Operations Research Letters
Extracting hierarchies with overlapping structure from network data
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
One way to help understand the structure of certain networks is to examine what common group memberships the actors in the network share. Linking actors to their common affiliations gives an alternative type of network commonly called an affiliation network. Recently, there have been several studies examining the problem of modeling the dynamics of a network through the changes in the affiliations of its actors. We examine the closely related problem of modeling the affiliations for a given network. We especially focus on the case of trying to mine these affiliations when the original network is potentially missing links.