Name
Abstract | ||
|---|---|---|
Blockmodelling is an important technique for detecting underlying patterns in graphs. However, existing blockmodelling algorithms do not provide the user with any explicit control to specify which patterns might be of interest. Furthermore, existing algorithms focus on finding standard community structures in graphs, and are likely to overlook informative but more complex patterns, such as hierarchical or ring blockmodel structures. In this paper, we propose a generic constraint programming framework for blockmodelling, which allows a user to specify and search for complex blockmodel patterns in graphs. Our proposed framework can be incorporated into existing iterative blockmodelling algorithms, operating as a hybrid optimization scheme that provides high flexibility and expressiveness. We demonstrate the power of our framework for discovering complex patterns, via experiments over a range of synthetic and real data sets. |
Year | Venue | Field |
|---|---|---|
2018 | SDM | Graph,Data set,Computer science,Constraint programming,Artificial intelligence,Machine learning,Expressivity |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
11 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohadeseh Ganji | 1 | 8 | 1.88 |
| Jeffrey Chan | 2 | 427 | 36.55 |
| Peter J. Stuckey | 3 | 1 | 5.08 |
| James Bailey | 4 | 2172 | 164.56 |
| Christopher Leckie | 5 | 2422 | 155.20 |
| kotagiri ramamohanarao | 6 | 4716 | 993.87 |
| Ian Davidson | 7 | 1274 | 77.79 |