Eric L. Lee, Jing-Kai Lou, Wei-Ming Chen, Yen-Chih Chen, Shou-de Lin, Yen-Sheng Chiang, Kuan-Ta Chen
{"title":"Fairness-Aware Loan Recommendation for Microfinance Services","authors":"Eric L. Lee, Jing-Kai Lou, Wei-Ming Chen, Yen-Chih Chen, Shou-de Lin, Yen-Sheng Chiang, Kuan-Ta Chen","doi":"10.1145/2639968.2640064","DOIUrl":"https://doi.org/10.1145/2639968.2640064","url":null,"abstract":"Up to date, more than 15 billion US dollars have been invested in microfinance that benefited more than 160 million people in developing countries. The Kiva organization is one of the successful examples that use a decentralized matching process to match lenders and borrowers. Interested lenders from around the world can look for cases among thousands of applicants they found promising to lend the money to. But how can loan borrowers and lenders be successfully matched up in a microfinance platform like Kiva? We argue that a sophisticate recommender not only pairs up loan lenders and borrowers in accordance to their preferences, but should also help to diversify the distribution of donations to reduce the inequality of loans is highly demanded, as altruism, like any resource, can be congestible.\u0000 In this paper, we propose a fairness-aware recommendation system based on one-class collaborative-filtering techniques for charity and micro-loan platform such as Kiva.org. Our experiments on real dataset indicates that the proposed method can largely improve the loan distribution fairness while retaining the accuracy of recommendations.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"36 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126197913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Enhanced Collaborative Filtering with Flexible Item Popularity Control for Recommender Systems","authors":"Tu Chen, Hui Tian, Xuzhen Zhu","doi":"10.1145/2639968.2640058","DOIUrl":"https://doi.org/10.1145/2639968.2640058","url":null,"abstract":"With the emerging and rapid development of Internet applications like social networks, E-commerce and so on, massive information has been created and stored. Recommender systems have been developed to deal with the information overload problem. Various recommendation algorithms have been proposed and Collaborative Filtering (CF) is one of the most remarkable. However, many similarity-based CFs suffer from a popularity bias problem: Popular items are frequently recommended not necessarily promoting the accuracy but making the recommendation lacking diversity. In this paper, we firstly explain how the item popularity impacts on the recommendation. Secondly, we propose an enhanced collaborative filtering approach (ECF) by adding item popularity control into a user-taste based method. Different from some other existing item popularity based CF methods, the popularity control in our approach is flexible and tunable. After that, extensive experiments are performed on two real benchmark datasets where the relationship between item popularity control and recommendation accuracy and diversity is investigated and turns out to be nonlinear. Experimental results demonstrate that temperate item popularity control can further improve the recommendation accuracy and diversity significantly, compared with the pure user-taste based method. But intemperate control makes the performance even worse Thus the flexibility is indeed essential and valuable.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133121303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kung-Keat Teoh, Tahereh Pourshafie, V. Balakrishnan
{"title":"A gender lens perspective of the use of social network in higher education in Malaysia and Australia","authors":"Kung-Keat Teoh, Tahereh Pourshafie, V. Balakrishnan","doi":"10.1145/2639968.2640070","DOIUrl":"https://doi.org/10.1145/2639968.2640070","url":null,"abstract":"The use of social network sites (SNS) such as Facebook, Twitter, Linkedin, Pinterest, Google Plus+, Tumblr, and Instagram, among others, has increased at a very fast pace in the last few years. In tandem with its rising popularity, especially among teenagers, many academics in higher education have been experimenting with its use in formal and less formal ways, in classroom teaching. Studies on the use of SNS in higher education indicate mixed results. While some academics found that SNS only distracts students from actual study and do not improve academic performance, others discovered that it improves communication and teacher-student relationships. Most however, agree that SNS's popularity with students makes it a very useful tool to exploit for classroom teaching and management. There are very few studies which look into the effect of gender on the use of SNS in education. While studies have concluded that men and women approach and use SNS in slightly different ways, there is little in existing literature which tells us about how the use of SNS in higher education differs between men and women. This paper discusses research on the use of SNS in higher education by both genders. It details the results of a survey conducted in Malaysia and Australia and highlights how men and women perceive SNS use in higher education based on a framework built on Push Pull and Mooring theory.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115670091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Michal Jankowski-Lorek, R. Nielek, A. Wierzbicki, Kazimierz Zielinski
{"title":"Predicting Controversy of Wikipedia Articles Using the Article Feedback Tool","authors":"Michal Jankowski-Lorek, R. Nielek, A. Wierzbicki, Kazimierz Zielinski","doi":"10.1145/2639968.2640074","DOIUrl":"https://doi.org/10.1145/2639968.2640074","url":null,"abstract":"Different points of view, opinions and controversies constitute the inherent part of modern society. Early detection of controversy is crucial for increasing productivity in peer production systems. The paper presents novelty approach to detecting controversial articles on the Wikipedia based on users ratings from Article Feedback Tool. The performance of proposed approach is on par with state-of-the-art solutions, but may also be applied outside Wikipedia-like systems. Additionally, emotion polarity measures can be used to locate controversial parts of articles, based on talk pages sections. With help of proposed algorithms, all articles in English Wikipedia have been tagged as either controversial or non-controversial. The dataset has been published and can be used by other researchers.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134325804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enron Corporation: You're the Boss if People Get Mentioned to You","authors":"Apoorv Agarwal, Adinoyi Omuya, Jingwei Zhang, Owen Rambow","doi":"10.1145/2639968.2640065","DOIUrl":"https://doi.org/10.1145/2639968.2640065","url":null,"abstract":"In this paper we use a new type of network, which we call the mention network, for the task of dominance prediction of employees of the Enron corporation given their emails. We show that the network formed using \"who mentions whom to whom\" links out-performs the traditionally used Enron email network. We present a comprehensive set of experiments to conclude that organizational dominance is best predicted by capturing the number of people mentioned to a person i.e. if many more people get mentioned to a person then that person is the boss.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122030462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Models for Measuring Access Security of Web Application: Security Reference Model","authors":"Ana Cervigni Guerra, M. Pessôa","doi":"10.1109/SocialCom.2013.166","DOIUrl":"https://doi.org/10.1109/SocialCom.2013.166","url":null,"abstract":"Measurement units and knowledge of security properties are hardly known. This process causes the complex systems decomposition into simpler and smaller systems thus allowing the estimative of properties that will help the understanding and measurement of software systems security properties. This process provides the security model and the score of security attributes priority is calculated by AHP methodology. A security model example to illustrate this approach is presented.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126438862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Enhanced Collaborative Filtering with Flexible Item Popularity Control for Recommender Systems","authors":"Tu Chen, Hui Tian, Xuzhen Zhu","doi":"10.1145/2639968.2640076","DOIUrl":"https://doi.org/10.1145/2639968.2640076","url":null,"abstract":"With the emerging and rapid development of Internet applications like social networks, E-commerce and so on, massive information has been created and stored. Recommender systems have been developed to deal with the information overload problem. Various recommendation algorithms have been proposed and Collaborative Filtering (CF) is one of the most remarkable. However, many similarity-based CFs suffer from a popularity bias problem: Popular items are frequently recommended not necessarily promoting the accuracy but making the recommendation lacking diversity. In this paper, we firstly explain how the item popularity impacts on the recommendation. Secondly, we propose an enhanced collaborative filtering approach (ECF) by adding item popularity control into a user-taste based method. Different from some other existing item popularity based CF methods, the popularity control in our approach is flexible and tunable. After that, extensive experiments are performed on two real benchmark datasets where the relationship between item popularity control and recommendation accuracy and diversity is investigated and turns out to be nonlinear. Experimental results demonstrate that temperate item popularity control can further improve the recommendation accuracy and diversity significantly, compared with the pure user-taste based method. But intemperate control makes the performance even worse Thus the flexibility is indeed essential and valuable.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121678550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Role of Peer Influence in Churn in Wireless Networks","authors":"Qiwei Han, Pedro A. Ferreira","doi":"10.1145/2639968.2640075","DOIUrl":"https://doi.org/10.1145/2639968.2640075","url":null,"abstract":"Subscriber churn remains a top challenge for wireless carriers. In this paper, we look at the effect of peer influence on churn and we try to disentangle it from other effects that drive simultaneous churn across friends but that do not relate to peer influence. We analyze a random sample of roughly 10 thousand subscribers from large dataset from a major wireless carrier over a period of 10 months. We apply Generalized Propensity Scores to identify the role of peer influence. We show that the propensity to churn increases when friends do and that it increases more when many strong friends churn. Therefore, our results suggest that churn managers should consider strategies aimed at preventing group churn.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127972786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"How to Become a More Popular Thread on Tianya Club","authors":"Jindong Chen, Lina Cao, Xijin J. Tang","doi":"10.1145/2639968.2640085","DOIUrl":"https://doi.org/10.1145/2639968.2640085","url":null,"abstract":"In Bulletin Board System, when an author submits a post to start a thread, what kinds of elements affect the popularity of this thread? To address this issue, Tianya Zatan board of Tianya Club is selected as data source for this study. Through database and online data, the daily new threads with high degree of online interactions in 2012 are collected for analysis. To explore the key elements relating to the popularity of thread, several elements are analyzed using different methods: the topics of original posts are based on Latent Dirichlet Allocation, the high frequency words of titles, the basic features (the length of titles, the titles with/without picture information, and the length of the content of original posts) and reply modes are based on statistics. Finally, several practical tips for an author to promote the popularity of the thread are given.","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121106835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Pilot Study about Military Users and Information Systems: Exploring Military User Attitudes about Technology","authors":"IV HarryD.Tunnell","doi":"10.1109/SocialCom.2013.136","DOIUrl":"https://doi.org/10.1109/SocialCom.2013.136","url":null,"abstract":"","PeriodicalId":206201,"journal":{"name":"IEEE International Conference on Social Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122077043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}