Graph Hybrid Summarization | ||
| Journal of AI and Data Mining | ||
| مقاله 9، دوره 6، شماره 2، مهر 2018، صفحه 335-340 اصل مقاله (926.39 K) | ||
| نوع مقاله: Original/Review Paper | ||
| شناسه دیجیتال (DOI): 10.22044/jadm.2017.5572.1665 | ||
| نویسندگان | ||
| N. Ashrafi Payaman؛ M.R. Kangavari* | ||
| Computer Engineering, Iran University of Science & Technology, Narmak, Tehran, Iran. | ||
| چکیده | ||
| One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and attribute-based summaries respectively. For an attributed graph, a high quality summary is one that covers both graph structure and its attributes with the user-specified degrees of importance. Recently two methods has been proposed for summarizing a graph based on both graph structure and attribute similarities. In this paper, a new method for hybrid summarization of a given attributed graph has proposed and the quality of the summary generated by this method has compared with the recently proposed method for this purpose. Experimental results showed that our proposed method generates a summary with a better quality. | ||
| کلیدواژهها | ||
| Graph Summarization؛ Super-node؛ Super-edge؛ Structural similarity؛ Attribute-based Similarity | ||
|
آمار تعداد مشاهده مقاله: 2,130 تعداد دریافت فایل اصل مقاله: 1,145 |
||