Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining generalized association rules
Future Generation Computer Systems - Special double issue on data mining
MPI-The Complete Reference, Volume 1: The MPI Core
MPI-The Complete Reference, Volume 1: The MPI Core
Using MPI-2: Advanced Features of the Message-Passing Interface
Using MPI-2: Advanced Features of the Message-Passing Interface
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
The Journal of Machine Learning Research
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Probabilistic author-topic models for information discovery
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Evaluating similarity measures: a large-scale study in the orkut social network
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Collaborative Filtering by Mining Association Rules from User Access Sequences
WIRI '05 Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration
Robustness of collaborative recommendation based on association rule mining
Proceedings of the 2007 ACM conference on Recommender systems
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Pfp: parallel fp-growth for query recommendation
Proceedings of the 2008 ACM conference on Recommender systems
PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Parallel algorithms for mining large-scale rich-media data
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Confucius and "its" intelligent disciples
Proceedings of the 18th ACM conference on Information and knowledge management
AdHeat: an influence-based diffusion model for propagating hints to match ads
Proceedings of the 19th international conference on World wide web
Distributed nonnegative matrix factorization for web-scale dyadic data analysis on mapreduce
Proceedings of the 19th international conference on World wide web
Towards understanding the external links of video sharing sites: measurement and analysis
Proceedings of the 20th international workshop on Network and operating systems support for digital audio and video
Taking advantage of contextualized interactions while users watch TV
Multimedia Tools and Applications
Affiliation recommendation using auxiliary networks
Proceedings of the fourth ACM conference on Recommender systems
Improving one-class collaborative filtering by incorporating rich user information
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Semantic grounding of hybridization for tag recommendation
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Soft-constraint based online LDA for community recommendation
PCM'10 Proceedings of the Advances in multimedia information processing, and 11th Pacific Rim conference on Multimedia: Part II
Which photo groups should I choose? A comparative study of recommendation algorithms in Flickr
Journal of Information Science
Collection-based sparse label propagation and its application on social group suggestion from photos
ACM Transactions on Intelligent Systems and Technology (TIST)
PLDA+: Parallel latent dirichlet allocation with data placement and pipeline processing
ACM Transactions on Intelligent Systems and Technology (TIST)
Proceedings of the 20th international conference companion on World wide web
Predicting friendship links in social networks using a topic modeling approach
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Scalable Affiliation Recommendation using Auxiliary Networks
ACM Transactions on Intelligent Systems and Technology (TIST)
Group Profiling for Understanding Social Structures
ACM Transactions on Intelligent Systems and Technology (TIST)
Personalized activity streams: sifting through the "river of news"
Proceedings of the fifth ACM conference on Recommender systems
Factorization vs. regularization: fusing heterogeneous social relationships in top-n recommendation
Proceedings of the fifth ACM conference on Recommender systems
Bayesian latent variable models for collaborative item rating prediction
Proceedings of the 20th ACM international conference on Information and knowledge management
Interest-based real-time content recommendation in online social communities
Knowledge-Based Systems
Using latent topics to enhance search and recommendation in Enterprise Social Software
Expert Systems with Applications: An International Journal
A conversation with Dr. Edward Y. Chang
ACM SIGKDD Explorations Newsletter
Challenging the long tail recommendation
Proceedings of the VLDB Endowment
Applying latent semantic analysis to tag-based community recommendations
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
PathRank: Ranking nodes on a heterogeneous graph for flexible hybrid recommender systems
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Recommendation in Online Health Communities
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Proceedings of the 28th Annual ACM Symposium on Applied Computing
LCARS: a location-content-aware recommender system
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Combining latent factor model with location features for event-based group recommendation
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Enhancing tag-based collaborative filtering via integrated social networking information
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Nonparametric bayesian multitask collaborative filtering
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
FRec: a novel framework of recommending users and communities in social media
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Pairwise learning in recommendation: experiments with community recommendation on linkedin
Proceedings of the 7th ACM conference on Recommender systems
Mining user interest and its evolution for recommendation on the micro-blogging system
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Colbar: A collaborative location-based regularization framework for QoS prediction
Information Sciences: an International Journal
| Hi-index | 0.00 |
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over time, users have even greater need for effective community recommendations in order to meet more users. In this paper, we investigate two algorithms from very different domains and evaluate their effectiveness for personalized community recommendation. First is association rule mining (ARM), which discovers associations between sets of communities that are shared across many users. Second is latent Dirichlet allocation (LDA), which models user-community co-occurrences using latent aspects. In comparing LDA with ARM, we are interested in discovering whether modeling low-rank latent structure is more effective for recommendations than directly mining rules from the observed data. We experiment on an Orkut data set consisting of 492,104 users and 118,002 communities. Our empirical comparisons using the top-k recommendations metric show that LDA performs consistently better than ARM for the community recommendation task when recommending a list of 4 or more communities. However, for recommendation lists of up to 3 communities, ARM is still a bit better. We analyze examples of the latent information learned by LDA to explain this finding. To efficiently handle the large-scale data set, we parallelize LDA on distributed computers and demonstrate our parallel implementation's scalability with varying numbers of machines.