文件名称：A SURVEY OF ALGORITHMS FOR DENSE SUBGRAPH DISCOVERY
文件大小：919KB
文件格式：PDF
更新时间：2015-02-21 13:42:50
graph mining
A survey of algorithms for dense subgraph discovery is presented in this paper. The problem of dense subgraph discovery is closely related to clustering though the two problems also have a number of differences. For example, the problem of clustering is largely concerned with that of finding a fixed partition in the data, whereas the problem of dense subgraph discovery defines these dense compo- nents in a much more flexible way. The problem of dense subgraph discovery may wither be defined over single or multiple graphs. Both cases are explored in this paper. In the latter case, the problem is also closely related to the problem of the frequent subgraph discovery. This chapter will discuss and organize the literature on this topic effectively in order to make it much more accessible to the reader.