Ming-Sheng Shang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ming-Sheng Shang has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- An Zeng
Department of Physics University of Fribourg Chemin du Musée 3 CH-1700 Fribourg Switzerland
6 shared publications Wei Zeng
Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China; State Key Laboratory of Networking and Switching Technology, Beijing, P.R. China; Department of Physics, University of Fribourg, Fribourg, Switzerland
3 shared publicationsYi-Cheng Zhang
Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China; Department of Physics, University of Fribourg, Fribourg, Switzerland; Institute of Information Economy, Hangzhou Normal University, Hangzhou, China
3 shared publicationsQian-Ming Zhang
Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, People's Republic of China
2 shared publicationsYuan Guan
Web Science Center, University of Electronic Science and Technology of China, Chengdu 611731, PR China
2 shared publicationsDandan Zhao
Web Science Center, University of Electronic Science and Technology of China, Chengdu 611731, PR China
1 shared publication
Latest Publications
- Open Access
Iterative resource allocation based on propagation feature of node for identifying the influential nodes
The Identification of the influential nodes in networks is one of the most promising domains. In this paper, we present an improved iterative resource allocation (IIRA) method by considering the centrality information of neighbors and the influence of spreading rate for a target node. Comparing with the results of the Susceptible Infected Recovered (SIR) model for four real networks, the IIRA method could identify influential nodes more accurately than the tradition IRA method. Specially, in the Erdos network, the Kendall's tau could be enhanced 23\% when the spreading rate is 0.12. In the Protein network, the Kendall's tau could be enhanced 24\% when the spreading rate is 0.08.
Open AccessIterative resource allocation based on propagation feature of node for identifying the influential nodes
The Identification of the influential nodes in networks is one of the most promising domains. In this paper, we present an improved iterative resource allocation (IIRA) method by considering the centrality information of neighbors and the influence of spreading rate for a target node. Comparing with the results of the Susceptible Infected Recovered (SIR) model for four real networks, the IIRA method could identify influential nodes more accurately than the tradition IRA method. Specially, in the Erdos network, the Kendall's tau could be enhanced 23\% when the spreading rate is 0.12. In the Protein network, the Kendall's tau could be enhanced 24\% when the spreading rate is 0.08.
- Open Access
- 24 October 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (10) , e111005
Similarity from Multi-Dimensional Scaling: Solving the Accuracy and Diversity Dilemma in Information Filtering
Recommender systems are designed to assist individual users to navigate through the rapidly growing amount of information. One of the most successful recommendation techniques is the collaborative filtering, which has been extensively investigated and has already found wide applications in e-commerce. One of challenges in this algorithm is how to accurately quantify the similarities of user pairs and item pairs. In this paper, we employ the multidimensional scaling (MDS) method to measure the similarities between nodes in user-item bipartite networks. The MDS method can extract the essential similarity information from the networks by smoothing out noise, which provides a graphical display of the structure of the networks. With the similarity measured from MDS, we find that the item-based collaborative filtering algorithm can outperform the diffusion-based recommendation algorithms. Moreover, we show that this method tends to recommend unpopular items and increase the global diversification of the networks in long term.
- 24 October 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (10) , e111005
Open AccessSimilarity from Multi-Dimensional Scaling: Solving the Accuracy and Diversity Dilemma in Information Filtering
Recommender systems are designed to assist individual users to navigate through the rapidly growing amount of information. One of the most successful recommendation techniques is the collaborative filtering, which has been extensively investigated and has already found wide applications in e-commerce. One of challenges in this algorithm is how to accurately quantify the similarities of user pairs and item pairs. In this paper, we employ the multidimensional scaling (MDS) method to measure the similarities between nodes in user-item bipartite networks. The MDS method can extract the essential similarity information from the networks by smoothing out noise, which provides a graphical display of the structure of the networks. With the similarity measured from MDS, we find that the item-based collaborative filtering algorithm can outperform the diffusion-based recommendation algorithms. Moreover, we show that this method tends to recommend unpopular items and increase the global diversification of the networks in long term.
- Open Access
- 18 November 2013
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 8 (11) , e79354
Information Filtering in Sparse Online Systems: Recommendation via Semi-Local Diffusion
With the rapid growth of the Internet and overwhelming amount of information and choices that people are confronted with, recommender systems have been developed to effectively support users’ decision-making process in the online systems. However, many recommendation algorithms suffer from the data sparsity problem, i.e. the user-object bipartite networks are so sparse that algorithms cannot accurately recommend objects for users. This data sparsity problem makes many well-known recommendation algorithms perform poorly. To solve the problem, we propose a recommendation algorithm based on the semi-local diffusion process on the user-object bipartite network. The simulation results on two sparse datasets, Amazon and Bookcross, show that our method significantly outperforms the state-of-the-art methods especially for those small-degree users. Two personalized semi-local diffusion methods are proposed which further improve the recommendation accuracy. Finally, our work indicates that sparse online systems are essentially different from the dense online systems, so it is necessary to reexamine former algorithms and conclusions based on dense data in sparse systems.
- 18 November 2013
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 8 (11) , e79354
Open AccessInformation Filtering in Sparse Online Systems: Recommendation via Semi-Local Diffusion
With the rapid growth of the Internet and overwhelming amount of information and choices that people are confronted with, recommender systems have been developed to effectively support users’ decision-making process in the online systems. However, many recommendation algorithms suffer from the data sparsity problem, i.e. the user-object bipartite networks are so sparse that algorithms cannot accurately recommend objects for users. This data sparsity problem makes many well-known recommendation algorithms perform poorly. To solve the problem, we propose a recommendation algorithm based on the semi-local diffusion process on the user-object bipartite network. The simulation results on two sparse datasets, Amazon and Bookcross, show that our method significantly outperforms the state-of-the-art methods especially for those small-degree users. Two personalized semi-local diffusion methods are proposed which further improve the recommendation accuracy. Finally, our work indicates that sparse online systems are essentially different from the dense online systems, so it is necessary to reexamine former algorithms and conclusions based on dense data in sparse systems.
- 9 September 2013
- Published by Springer Nature in The European Physical Journal B
- Vol. 86 (9) , 1-7
Membership in social networks and the application in information filtering
- 9 September 2013
- Published by Springer Nature in The European Physical Journal B
- Vol. 86 (9) , 1-7
Membership in social networks and the application in information filtering
- Open Access
- 14 May 2013
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 8 (5) , e62624
Extracting the Information Backbone in Online System
Information overload is a serious problem in modern society and many solutions such as recommender system have been proposed to filter out irrelevant information. In the literature, researchers have been mainly dedicated to improving the recommendation performance (accuracy and diversity) of the algorithms while they have overlooked the influence of topology of the online user-object bipartite networks. In this paper, we find that some information provided by the bipartite networks is not only redundant but also misleading. With such “less can be more” feature, we design some algorithms to improve the recommendation performance by eliminating some links from the original networks. Moreover, we propose a hybrid method combining the time-aware and topology-aware link removal algorithms to extract the backbone which contains the essential information for the recommender systems. From the practical point of view, our method can improve the performance and reduce the computational time of the recommendation system, thus improving both of their effectiveness and efficiency.
- 14 May 2013
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 8 (5) , e62624
Open AccessExtracting the Information Backbone in Online System
Information overload is a serious problem in modern society and many solutions such as recommender system have been proposed to filter out irrelevant information. In the literature, researchers have been mainly dedicated to improving the recommendation performance (accuracy and diversity) of the algorithms while they have overlooked the influence of topology of the online user-object bipartite networks. In this paper, we find that some information provided by the bipartite networks is not only redundant but also misleading. With such “less can be more” feature, we design some algorithms to improve the recommendation performance by eliminating some links from the original networks. Moreover, we propose a hybrid method combining the time-aware and topology-aware link removal algorithms to extract the backbone which contains the essential information for the recommender systems. From the practical point of view, our method can improve the performance and reduce the computational time of the recommendation system, thus improving both of their effectiveness and efficiency.
- 10 April 2013
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 392 (16) , 3417-3423
Preference of online users and personalized recommendations
- 10 April 2013
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 392 (16) , 3417-3423
Preference of online users and personalized recommendations
- Open Access
Extracting the information backbone in online system
Information overload is a serious problem in modern society and many solutions such as recommender system have been proposed to filter out irrelevant information. In the literature, researchers mainly dedicated to improve the recommendation performance (accuracy and diversity) of the algorithms while overlooked the influence of topology of the online user-object bipartite networks. In this paper, we find that some information provided by the bipartite networks is not only redundant but also misleading. With such "less can be more" feature, we design some algorithms to improve the recommendation performance by eliminating some links from the original networks. Moreover, we propose a hybrid method combining the time-aware and topology-aware link removal algorithms to extract the backbone which contains the essential information for the recommender systems. From the practical point of view, our method can improve the performance and reduce the computational time of the recommendation system, thus improve both of their effectiveness and efficiency.
Open AccessExtracting the information backbone in online system
Information overload is a serious problem in modern society and many solutions such as recommender system have been proposed to filter out irrelevant information. In the literature, researchers mainly dedicated to improve the recommendation performance (accuracy and diversity) of the algorithms while overlooked the influence of topology of the online user-object bipartite networks. In this paper, we find that some information provided by the bipartite networks is not only redundant but also misleading. With such "less can be more" feature, we design some algorithms to improve the recommendation performance by eliminating some links from the original networks. Moreover, we propose a hybrid method combining the time-aware and topology-aware link removal algorithms to extract the backbone which contains the essential information for the recommender systems. From the practical point of view, our method can improve the performance and reduce the computational time of the recommendation system, thus improve both of their effectiveness and efficiency.
- 13 March 2013
- Published by Institute of Advanced Engineering and Science in TELKOMNIKA Indonesian Journal of Electrical Engineering
- Vol. 11 (7)
Effect of User’s Judging Power on the Recommendation Performance
In most B2Cs, such as 5-star Amazon, users’ rating capability is nonhomogeneous, which make it necessary to distinguish different users' profiles. Besides, recommender systems sometimes overlook differences among users’ judging power and simply recommend for the target users based on the preferences of his/her neighbors, leading to unsatisfactory recommendation performances. In this paper, we firstly propose a natural extension of the YZLM algorithm to get users’ judging power. Then we equally divide the users into some groups so that the intra-group users have close judging power. Through experiments on three benchmark datasets, namely MovieLens, Netflix and Amazon, we can find the interesting phenomenon which indicates a positive correlation between groups’ judging power and group’s recommendation performance. By analyzing this phenomenon in detail, we put forward some guidance to improve recommendation algorithm according to different users' judging power.
- 13 March 2013
- Published by Institute of Advanced Engineering and Science in TELKOMNIKA Indonesian Journal of Electrical Engineering
- Vol. 11 (7)
Effect of User’s Judging Power on the Recommendation Performance
In most B2Cs, such as 5-star Amazon, users’ rating capability is nonhomogeneous, which make it necessary to distinguish different users' profiles. Besides, recommender systems sometimes overlook differences among users’ judging power and simply recommend for the target users based on the preferences of his/her neighbors, leading to unsatisfactory recommendation performances. In this paper, we firstly propose a natural extension of the YZLM algorithm to get users’ judging power. Then we equally divide the users into some groups so that the intra-group users have close judging power. Through experiments on three benchmark datasets, namely MovieLens, Netflix and Amazon, we can find the interesting phenomenon which indicates a positive correlation between groups’ judging power and group’s recommendation performance. By analyzing this phenomenon in detail, we put forward some guidance to improve recommendation algorithm according to different users' judging power.