An Improved Influential Cover Set Mining Algorithm

doi:10.23940/ijpe.18.11.p7.26122623

Int J Performability Eng ›› 2018, Vol. 14 ›› Issue (11): 2612-2623.doi: 10.23940/ijpe.18.11.p7.26122623

Previous Articles Next Articles

An Improved Influential Cover Set Mining Algorithm

Jia Liu^{a, b}, Wei Chen^{a, b, *}, Ziyang Chen^{a, c}, and Huijuan Liu^a

^a School of Information Science and Engineering, YanShan University, Qinhuangdao, 066004, China;
^b Department of Information Engineering, Hebei University of Environmental Engineering, Qinhuangdao, 066102, China;
^c School of Information and Management, Shanghai Lixin University of Accounting and Finance, Shanghai, 201620, China

Submitted on ;
Contact: * E-mail address: chenwei@ysu.edu.cn
About author:Jia Liu is currently working toward a Ph.D. in the Department of Computer Science and Technology at Yanshan University, Qinhuangdao, China. She is also an associate professor. Her research interests include querying and processing on spatial information.Wei Chen is currently working toward a Ph.D. in the Department of Computer Science and Technology at Yanshan University, Qinhuangdao, China. She is also an associate professor. Her research interests include query processing on graph data.Ziyang Chen received his bachelor's degree, Master's degree, and Ph.D. in Computer Science from Yanshan University, Qinhuangdao, China in 1996, 2000, and 2009, respectively. He is currently a professor, Ph.D. supervisor, and distinguished professor at Shanghai Lixin University of Accounting and Finance. His research interests include database theory and techniques.Huijuan Liu is currently working toward a Master's degree in the Department of Computer Science and Technology at Yanshan University, Qinhuangdao, China. Her research interests include query processing on graph data.

Abstract

Abstract: The influential cover set (ICS) problem is a hot research issue in social networks and road networks. Considering that existing methods cannot take into account both the efficiency and the accuracy of results, we propose a partition-based influential cover set mining algorithm with the index. Firstly, we create the inverted index for each attribute to be queried, thus avoiding traversing all nodes while querying the node covered attributes and reducing the query time with high accuracy. Then, we design the pruning strategy according to the upper bound of cover-group for filtering, which reduces the number of the partition combination in the treatment on each tuple in the linked list of partitions, reduces the overall computation, and improves the processing speed and efficiency. Our experimental results on 15 real datasets verify the efficiency of our method in terms of different metrics, including indexing time, accuracy of results, influence of results, and query processing time.

Key words: road network, social network, influential cover set (ICS)

Jia Liu, Wei Chen, Ziyang Chen, and Huijuan Liu. An Improved Influential Cover Set Mining Algorithm [J]. Int J Performability Eng, 2018, 14(11): 2612-2623.

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

References

[1] R. Agrawal, A. Borgida,H. V. Jagadish, “Efficient Management of Transitive Relationships in Large Data and Knowledge Bases,” Journal of Clinical Investigation, Vol. 108, No. 8, pp. 1113-1121, 2001
[2] S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, R. Cyganiak,Z. Ives, “Dbpedia: A Nucleus for a Web of Open Data,” inProceedings of International Semantic Web Conference, Asian Semantic Web Conference, pp. 722-735, Busan, Korea, November 2007
[3] K. Bollacker, C. Evans, P. Paritosh, T. Sturge,J. Taylor, “Freebase: A Collaboratively Created Graph Database for Structuring Human Knowledge,” inProceedings of ACM SIGMOD International Conference on Management of Data, pp. 1247-1250, Columbia, British, June 2008
[4] B. João and Rocha-Junior, “Top-k Spatial Keyword Queries on Road Networks,” inProceedings of the 15th International Conference on Extending Database Technology, pp. 168-179, Berlin, Germany, March 2012
[5] W. Sun, C. Chen, B. Zheng, C. Chen, L. Zhu,W. Liu, “Merged Aggregate Nearest Neighbor Query Processing in Road Networks,” inProceedings of ACM International Conference on Information & Knowledge Management, pp. 2243-2248, San Francisco, CA, USA, August 2013
[6] D. Yan, Z. Zhao,W. Ng, “Efficient Algorithms for Finding Optimal Meeting Point on Road Networks,” in Proceedings of the VLDB Endowment, Vol. 4, No. 11, pp. 968-979, 2012
[7] A. Goyal, F. Bonchi,L. V. S.Lakshmanan, “Learning Influence Probabilities in Social Networks,” inProceedings of the Third International Conference on Web Search and Web Data Mining, pp. 241-250, New York, NY, USA, February 2010
[8] A. Goyal, W. Lu,L. V. S.Lakshmanan, “CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks,” inProceedings of the 20th International Conference on World Wide Web, pp. 47-48, Hyderabad, India, March 2011
[9] R. Jin, Y. Xiang, N. Ruan,D. Fuhry, “3-hop: A High-Compression Indexing Scheme for Reachability Query,” inProceedings of Special Interest Group on Management of Data International Conference, pp. 813-826, Barcelona Spain, August 2009
[10] Z. Lu, L. Fan, W. Wu, B. Thuraisingham,K. Yang, “Efficient Influence Spread Estimation for Influence Maximization under the Linear Threshold Model,” Computational Social Networks, Vol. 1, No. 1, pp. 1-19, 2014
[11] G. Swamynathan, C. Wilson,B. Boe, “Do Social Networks Improve E-Commerce: A Study on Social Market Places,” inProceedings of the First Workshop on Online Social Networks, pp. 1-6, Seattle, WA, USA, August 2008
[12] J. S. Bader, A. Chaudhuri,J. M. Rothberg, “Gaining Confidence in High-Through Put Protein Interaction Networks,” Nature Biotechnology, Vol. 22, No. 1, pp. 78-85, 2003
[13] N. Barbieri, F. Bonchi,G. Manco, “Topic-Aware Social Influence Propagation Models,” Knowledge and Information Systems, Vol. 37, No. 3, pp. 555-584, 2012
[14] W. Chen, C. Wang,Y. Wang, “Scalable In?uence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks,” inProceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1029-1038, Washington, DC, USA, July 2010
[15] W. Chen, Y. Wang,S. Yang, “Efﬁcient In?uence Maximization in Social Networks,” inProceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 199-208, Paris, France, July 2009
[16] J. Kim, S. K. Kim,H. Yu, “Scalable and Parallelizable Processing of In?uence Maximization for Large-Scale Social Networks?” in Proceedings of the 29th IEEE International Conference on Data Engineering, Brisbane, Australia, April 2013
[17] J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen,N. Glance, “Cost-Effective Outbreak Detection in Networks,” inProceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 420-429, August 2007
[18] B. Liu, G. Cong, D. Xu,Y. Zeng, “Time Constrained In?uence Maximization in Social Networks,” inProceedings of the IEEE International Conference on Data Mining, pp. 439-448, Vancouver, Canada, December 2012
[19] K. Feng, G. Cong, S. S. Bhowmick,S. Ma, “In Search of Influential Event Organizers in Online Social Networks,” inProceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 63-74, Snowbird, Utah, USA, June 2014

An Improved Influential Cover Set Mining Algorithm

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 8

Recommended 0

[1]	Yuan Liang. Modelling and Learning User Feedback in Event-based Social Networks [J]. Int J Performability Eng, 2022, 18(1): 11-21.
[2]	Anuja Arora, and Anu Taneja. Research Issues, Innovation and Associated Approaches for Recommendation on Social Networks [J]. Int J Performability Eng, 2021, 17(12): 1027-1036.
[3]	Caiming Zhang, and Weina Fu. Optimal Model for Patrols of UAVs in Power Grid under Time Constraints [J]. Int J Performability Eng, 2021, 17(1): 103-113.
[4]	Ankit Kumar, Dipansha Chhabra, Bhavya Mendiratta, and Adwitiya Sinha. Potential Extensions and Updates in Social Media for Twitter Developers [J]. Int J Performability Eng, 2020, 16(8): 1139-1150.
[5]	Guoqiang Gong, Xin Cao, Ye Jin, Xiaobo Ding, and Ke Lv. K-Community Anonymity Approach for Social Network Data [J]. Int J Performability Eng, 2020, 16(10): 1665-1673.
[6]	Shujuan Ji, Da Li, Qing Zhang, Chunjin Zhang, and Chunxiao Bao. Cascaded Trust Network-based Block-Incremental Recommendation Strategy [J]. Int J Performability Eng, 2019, 15(3): 743-755.
[7]	Huajiang Men, Xiaoyu Ji, and Wei Wang. Using Community Detection to Discover Opinion Leaders in Social Circles [J]. Int J Performability Eng, 2019, 15(3): 861-871.
[8]	Pengju Wang, Huifeng Xue, Zhe Yu, and Feng Zhang. Semantic Fusion and Propagation Model for Internet Public Opinion Data in Big Data Environment [J]. Int J Performability Eng, 2019, 15(12): 3099-3107.