A novel approach to exploring maximum consensus graphs from users’ preference data in a new age environment
- 219 Downloads
Many methods have been used to produce coherent aggregated results from individual’s preference data, such as decision-making support systems, group recommendation systems, and so on. This study proposes a new framework where a graph model is used to represent user preferences and develops a new algorithm for detecting the maximum consensus and majority user group. The maximum consensus graph can be used to illustrate the preferences of the majority of the users. Similarly, discovering the segment of users who belong to the majority is useful information for the decision maker in order to produce consensus opinions and for market mangers to propose the most feasible strategies. In this study we initiate a new approach to the group ranking problem. Experiments using synthetic and real datasets show the model’s computational efficiency, scalability, and effectiveness.
KeywordsData mining Decision making Group decision making Maximum consensus sequence Graph mining
The authors are very grateful to the anonymous referees for their helpful comments and valuable suggestions for improving the earlier version of the paper. This research was supported by the Ministry of Science and Technology, Taiwan, R.O.C. under the Grant NSC 100-2410-H-031-010-MY2 and NSC 102-2410-H-031-058-MY3. We appreciate Tsai Hsieh Che to assistant program of this study.
- 12.Fagin, R., Kumar, R., & Sivakumar, D. (2003). Efficient similarity search and classification via rank aggregation. In Proceedings of the 2003 ACM SIGMOD iIternational Conference on Management of Data (pp. 301–312). Bridgeton: ACM.Google Scholar
- 25.Saint, S., & Lawson, J. R. (1994). Rules for reaching consensus: A modern approach to decision making. Amsterdam: Pfeiffer.Google Scholar
- 26.Han, J., Kamber, M., & Pei, J. (2011). Data mining: concepts and techniques. Amsterdam: Elsevier.Google Scholar
- 27.Huan, J., Wang, W., & Prins, J. Efficient mining of frequent subgraphs in the presence of isomorphism. In Data Mining, 2003. ICDM 2003. Third IEEE International Conference on, 2003 (pp. 549–552). IEEE.Google Scholar
- 29.Kang, U., Tsourakakis, C. E., & Faloutsos, C. Pegasus: A peta-scale graph mining system implementation and observations. In Data Mining, 2009. ICDM’09. Ninth IEEE International Conference on, 2009 (pp. 229–238). IEEE.Google Scholar
- 30.Inokuchi, A., Washio, T., & Motoda, H. (2000). An apriori-based algorithm for mining frequent substructures from graph data. In PKDD’00: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery (pp. 13–23). Springer.Google Scholar
- 32.Vanetik, N., Gudes, E., & Shimony, S. E. (2002). Computing frequent graph patterns from semistructured data. In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on, 2002 (pp. 458–465). IEEE.Google Scholar
- 33.Kuramochi, M., & Karypis, G. (2001). Frequent subgraph discovery. In Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on, 2001 (pp. 313–320). IEEE.Google Scholar
- 34.Tong, H., Faloutsos, C., & Koren, Y. (2007). Fast direction-aware proximity for graph mining. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 747–756). Bridgeton: ACM.Google Scholar
- 35.Cheng, L.-C., & Jhang, M.-J. (2012). Applied graph mining technique to discover consensus graphs from group ranking decisions. In Proceedings on the International Conference on Artificial Intelligence (ICAI) (p. 1). The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp).Google Scholar