Research on OLAP Algorithm Based on Attributes and Relationships
Yuxia Sheng · Computer Technology and Development · 2014
With the rise of social networks,especially the concept of OLAP has been proposed,people make a lot of research on the OLAP algorithm,in which the graph clustering algorithm also attracts widespread attention.However,most of these algorithms are only concerned about attributes or relationships between nodes,rarely taking into account both the node's attributes and the relationships between them.In this paper,consider this problem,meanwhile even taking the problem of the tightness of the node which is in the division group into account,and also use the idea of the modular in the network on partitioning procedure,so that the results of partitioning will have a more realistic significance.And the Q-function theory is so well applied to the process of dividing the community that emphasize on the impact of individual nodes for the entire community,making each child after division within the community much closer.