Title
On Package Organization for Willingness Satisfaction in Social Networks
Abstract
Studies show that both the personal preference and social tightness between friends play important roles in the decision process of activity participation for a person. Considering the preference of a person and the social tightness among friends, in this work, we formulate a new research problem, called Package Organization for Willingness sAtisfaction (POWA), to effectively select items into a package that can be adopted by the most users. Efficiently obtaining the optimal package and the corresponding group of users under the setting of POWA is very challenging, as we prove that POWA is NP-hard. Aiming to strike a balance between the quality of solutions and the time needed for computation, we propose algorithm Intermediate Package Organization with Social and Preference Pruning (IPOSPP) to obtain good solutions efficiently. We conduct an extensive performance evaluation on four real datasets to demonstrate the performance of the proposed algorithm.
Year
DOI
Venue
2013
10.1109/.20
TAAI
Keywords
Field
DocType
extensive performance evaluation,willingness satisfaction,preference pruning,personal preference,social tightness,social networks,optimal package,activity participation,proposed algorithm,package organization,algorithm intermediate package organization,computational complexity
Algorithm design,Social network,Computer science,Artificial intelligence,Decision process,Machine learning,Computational complexity theory,Computation
Conference
ISSN
Citations 
PageRank 
1066-6192
0
0.34
References 
Authors
13
7
Name
Order
Citations
PageRank
Chung-Kuang Chou1255.52
Hui-Ju Hung2484.29
Hong-Han Shuai310024.80
Chih-Ya Shen410317.13
De-Nian Yang558666.66
Meng-jung Shih6655.04
Wei-Jung Lai700.34