1,735 research outputs found

    On the Predictability of Talk Attendance at Academic Conferences

    Full text link
    This paper focuses on the prediction of real-world talk attendances at academic conferences with respect to different influence factors. We study the predictability of talk attendances using real-world tracked face-to-face contacts. Furthermore, we investigate and discuss the predictive power of user interests extracted from the users' previous publications. We apply Hybrid Rooted PageRank, a state-of-the-art unsupervised machine learning method that combines information from different sources. Using this method, we analyze and discuss the predictive power of contact and interest networks separately and in combination. We find that contact and similarity networks achieve comparable results, and that combinations of different networks can only to a limited extend help to improve the prediction quality. For our experiments, we analyze the predictability of talk attendance at the ACM Conference on Hypertext and Hypermedia 2011 collected using the conference management system Conferator

    Recommender Systems

    Get PDF
    The ongoing rapid expansion of the Internet greatly increases the necessity of effective recommender systems for filtering the abundant information. Extensive research for recommender systems is conducted by a broad range of communities including social and computer scientists, physicists, and interdisciplinary researchers. Despite substantial theoretical and practical achievements, unification and comparison of different approaches are lacking, which impedes further advances. In this article, we review recent developments in recommender systems and discuss the major challenges. We compare and evaluate available algorithms and examine their roles in the future developments. In addition to algorithms, physical aspects are described to illustrate macroscopic behavior of recommender systems. Potential impacts and future directions are discussed. We emphasize that recommendation has a great scientific depth and combines diverse research fields which makes it of interests for physicists as well as interdisciplinary researchers.Comment: 97 pages, 20 figures (To appear in Physics Reports

    Can Who-Edits-What Predict Edit Survival?

    Get PDF
    As the number of contributors to online peer-production systems grows, it becomes increasingly important to predict whether the edits that users make will eventually be beneficial to the project. Existing solutions either rely on a user reputation system or consist of a highly specialized predictor that is tailored to a specific peer-production system. In this work, we explore a different point in the solution space that goes beyond user reputation but does not involve any content-based feature of the edits. We view each edit as a game between the editor and the component of the project. We posit that the probability that an edit is accepted is a function of the editor's skill, of the difficulty of editing the component and of a user-component interaction term. Our model is broadly applicable, as it only requires observing data about who makes an edit, what the edit affects and whether the edit survives or not. We apply our model on Wikipedia and the Linux kernel, two examples of large-scale peer-production systems, and we seek to understand whether it can effectively predict edit survival: in both cases, we provide a positive answer. Our approach significantly outperforms those based solely on user reputation and bridges the gap with specialized predictors that use content-based features. It is simple to implement, computationally inexpensive, and in addition it enables us to discover interesting structure in the data.Comment: Accepted at KDD 201

    ํ˜‘์—…ํ•„ํ„ฐ๋ง์„ ์œ„ํ•œ์‹œ๊ฐ„์— ๋”ฐ๋ผ ๋ณ€ํ™”ํ•˜๋Š” ์ƒํ’ˆ ํŠน์ง• ์กฐ๊ฑด๋ถ€ ๋ณ€๋ถ„ ์ž๋™ ์ƒ์„ฑ๊ธฐ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(์„์‚ฌ)--์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› :๊ณต๊ณผ๋Œ€ํ•™ ์‚ฐ์—…๊ณตํ•™๊ณผ,2019. 8. ์กฐ์„ฑ์ค€.์‚ฌ์šฉ์ž๊ฐ€ ์ƒํ’ˆ ์„ ํƒ์„ ๊ฒฐ์ •ํ•  ๋•Œ ์˜ํ–ฅ์„ ๋ฏธ์น˜๋Š” ์š”์†Œ ์ค‘์—๋Š” ์‹œ๊ธฐ์  ์š”์†Œ์™€๋Š” ๋ฌด๊ด€ํ•œ ์‚ฌ์šฉ์ž ๊ณ ์œ ์˜ ์ทจํ–ฅ๊ณผ ์‹œ์ ์— ๋”ฐ๋ผ ๋ณ€ํ™”ํ•˜๋Š” ์ƒํ’ˆ์˜ ์œ ํ–‰๊ณผ ๊ฐ™์€ ์™ธ๋ถ€์กฑ ์š”์†Œ๊ฐ€ ์กด์žฌํ•œ๋‹ค. ์ •๋ฐ€ํ•œ ์ถ”์ฒœ์‹œ์Šคํ…œ์„ ๋งŒ๋“ค๊ธฐ ์œ„ํ•ด์„œ๋Š” ์ด ๋‘ ์š”์†Œ๋ฅผ ๋ชจ๋‘ ๊ณ ๋ คํ•ด์•ผ ํ•˜์ง€๋งŒ ๊ธฐ์กด์˜ ์ถ”์ฒœ ์‹œ์Šคํ…œ์€ ์ถ”์ฒœ์„ ํ•ด์ฃผ๋Š” ๊ทธ ๋‹น์‹œ์˜ ์‹œ์ ์„ ๊ณ ๋ คํ•˜์ง€ ์•Š๊ณ  ์‚ฌ์šฉ์ž์˜ ๊ตฌ๋งค๋‚ด์—ญ ๋ฐ์ดํ„ฐ๋งŒ์„ ๊ธฐ๋ฐ˜์œผ๋กœ ์ถ”์ฒœ์„ ํ•ด์ค€๋‹ค๋Š” ๋ฌธ์ œ์ ์„ ๊ฐ–๊ณ  ์žˆ๋‹ค. ๋”ฐ๋ผ์„œ, ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ์ถ”์ฒœ์ด ์ง„ํ–‰๋˜๋Š” ์‹œ์ ์„ ๊ณ ๋ คํ•˜์—ฌ, ๊ทธ ๋‹น์‹œ์˜ ์ƒํ’ˆ ์œ ํ–‰ ์š”์†Œ๋ฅผ ๋ฐ˜์˜ํ•œ ์ถ”์ฒœ ์‹œ์Šคํ…œ์„ ์ œ์•ˆํ•œ๋‹ค. ์šฐ๋ฆฌ๋Š” ์ƒํ’ˆ ๋‚ด์šฉ ๊ธฐ๋ฐ˜์˜ ์ถ”์ฒœ ์‹œ์Šคํ…œ๊ณผ ์‚ฌ์šฉ์ž ๊ตฌ๋งค ๋‚ด์—ญ ๊ธฐ๋ฐ˜์˜ ์ถ”์ฒœ์‹œ์Šคํ…œ์„ ํšจ๊ณผ์ ์œผ๋กœ ๊ฒฐํ•ฉํ•  ์ˆ˜ ์žˆ๋Š” ๋ชจ๋ธ ์ƒ์„ฑ์— ์ดˆ์ ์„ ๋‘์—ˆ๋‹ค. ๊ตฌ์ฒด์ ์œผ๋กœ, ์‚ฌ์šฉ์ž-์ƒํ’ˆ ๋‚ดํฌ ํ”ผ๋“œ๋ฐฑ์— ์ƒํ’ˆ์˜ ์‹œ๊ฐ„ ๊ธฐ๋ฐ˜ ํŠน์ง•์„ ๋”ํ•˜๊ธฐ ์œ„ํ•ด ์กฐ๊ฑด๋ถ€ ๋ณ€๋ถ„ ์ž๋™ ์ƒ์„ฑ๊ธฐ ๋ชจ๋ธ์„ ํ™œ์šฉํ•œ๋‹ค. ์ด ๋•Œ ์ž…๋ ฅ ๊ฐ’๊ณผ ์ž ์žฌ๋ณ€์ˆ˜์— ๊ฐ๊ฐ ๋”ํ•ด์ฃผ๋Š” ์กฐ๊ฑด๋ถ€๋กœ๋Š” ๊ฐ ์‹œ์ ์˜ ์ƒํ’ˆ ํŠน์ง•์„ ๋‚˜ํƒ€๋‚ด๋Š” ๋ถ„์‚ฐ ํ‘œํ˜„์„ ์‚ฌ์šฉํ•œ๋‹ค. ๊ฐ ์‹œ์ ์— ํ•ด๋‹นํ•˜๋Š” ๋ถ„์‚ฐ ํ‘œํ˜„์€ LSTM์„ ์‚ฌ์šฉํ•˜์—ฌ ์ถ”์ถœํ•œ๋‹ค. LSTM์—์„œ ์–ป์€ ์กฐ๊ฑด๋ถ€์™€ ์‚ฌ์šฉ์ž-์ƒํ’ˆ ํ–‰๋ ฌ์„ ์—ฐ๊ฒฐ์‹œ์ผœ ๋ณ€๋ถ„ ์ž๋™ ์ƒ์„ฑ๊ธฐ์— ์ž…๋ ฅํ•ด์คŒ์œผ๋กœ์จ, ๊ฐ ๊ตฌ๊ฐ„์˜ ์ค‘์š”ํ•œ ํŠน์ง•์„ ๋ฐ˜์˜ํ•˜๋Š” ํ•˜์ด๋ธŒ๋ฆฌ๋“œ ์ถ”์ฒœ์‹œ์Šคํ…œ์„ ์ƒ์„ฑํ•œ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ ์ œ์•ˆํ•˜๋Š” ๋ชจ๋ธ์€ ์ƒํ’ˆ ๊ณ ์œ ์˜ ๋ณ€ํ™”ํ•˜๋Š” ํŠน์„ฑ์„ ๋ฐ˜์˜ํ•˜์—ฌ ์ถ”์ฒœ์— ํ™œ์šฉํ•œ๋‹ค๋Š” ์ ์—์„œ ๊ธฐ์กด ์—ฐ๊ตฌ์™€ ์ฐจ์ด๊ฐ€ ์žˆ๋‹ค. ๋˜ํ•œ, ๋ณธ ์—ฐ๊ตฌ๋Š” ์ถ”์ฒœ์‹œ์Šคํ…œ ๋ฐ์ดํ„ฐ์˜ ์„ฌ๊น€์„ฑ ๋ฌธ์ œ๋ฅผ ์™„ํ™”ํ•˜๋Š”๋ฐ์—๋„ ๋„์›€์„ ์ค€๋‹ค. ์ œ์•ˆํ•˜๋Š” ๋ชจ๋ธ์˜ ํ‰๊ฐ€๋ฅผ ์œ„ํ•ด Movielens dataset(ml-1m) ๋ฐ์ดํ„ฐ์™€ Amazon women's clothing ๋ฐ์ดํ„ฐ๋ฅผ ์‚ฌ์šฉํ•˜์˜€๊ณ , ์ œ์•ˆํ•˜๋Š” ๋ฐฉ๋ฒ•์— ์•Œ๋งž์€ ์‹คํ—˜ ๊ณผ์ •์„ ์„ค๊ณ„ํ•˜์—ฌ ๋ชจ๋ธ์˜ ์œ ํšจ์„ฑ์„ ํ™•์ธํ–ˆ๋‹ค.We can assume that some factors that affect the user's decision to select products are several factors such as the time-invariant user's unique taste and the external trends or fashion that varies with time. Both mentioned factors should be considered in order to create a precise recommendation system, but the current recommendation system has the problem of making recommendations based only on the user's history without taking into account the timing of creating a recommendation. Therefore, considering the timing of the recommendation made, this paper proposes a recommendation system that reflects inter-items trends of time-based bin. We focus on creating a model that could effectively combine the content-based recommender system with the context-based recommender system. Specifically, we use Conditional Variational Autoencoder to add a time dynamic item features to user-item implicit feedback data. In this case, distributed representation of items in the specific period is used as a condition that is added to input and latent variable of VAE respectively. The distributed representation per periods can be extracted using LSTM. By putting a condition into VAE, a hybrid recommendation system can be created to reflect the item trend. The model proposed in this paper differs from existing research in that it reflects the changing characteristics inherent in the product and utilizes it in the recommendation. In addition, we can get the additional effect of solving sparsity problem by using item feature to mitigate sparsity problem. The Movielens data (ml-1m) data and Amazon women's clothing dataset are used for the evaluation of the proposed model. The effectiveness of this model is verified by designing experimental methods to evaluate the recommended systems that reflect the time point of recommendation.1.Introduction 1.1 Problem description 1.2 Research motivation and contribution 1.3 Organization of the thesis 2. Literature review 2.1 Review on neural network models 2.1.1 LSTM 2.1.2 Variation Autoencoder 2.1.3 Conditional Variational Autoencoder 2.2 Review on recommender system 3. Solution approaches 3.1 Content feature encoder - Long Short Term Memory 3.2 User-Item matrix generator - conditional variation autoencoder 3.2.1 Conditional variational autoencoder 3.2.2 Attention conditional variational autoencoder 3.3 Process of training 4. Experimental procedure 4.1 Evaluation datasets 4.2 Experimental setting 4.3 Evaluation metrics 4.4 Baseline 4.5 Results and discussion 5. Conclusion 5.1 Conclusion 5.2 Future directionMaste

    Adversarial Training Towards Robust Multimedia Recommender System

    Full text link
    With the prevalence of multimedia content on the Web, developing recommender solutions that can effectively leverage the rich signal in multimedia data is in urgent need. Owing to the success of deep neural networks in representation learning, recent advance on multimedia recommendation has largely focused on exploring deep learning methods to improve the recommendation accuracy. To date, however, there has been little effort to investigate the robustness of multimedia representation and its impact on the performance of multimedia recommendation. In this paper, we shed light on the robustness of multimedia recommender system. Using the state-of-the-art recommendation framework and deep image features, we demonstrate that the overall system is not robust, such that a small (but purposeful) perturbation on the input image will severely decrease the recommendation accuracy. This implies the possible weakness of multimedia recommender system in predicting user preference, and more importantly, the potential of improvement by enhancing its robustness. To this end, we propose a novel solution named Adversarial Multimedia Recommendation (AMR), which can lead to a more robust multimedia recommender model by using adversarial learning. The idea is to train the model to defend an adversary, which adds perturbations to the target image with the purpose of decreasing the model's accuracy. We conduct experiments on two representative multimedia recommendation tasks, namely, image recommendation and visually-aware product recommendation. Extensive results verify the positive effect of adversarial learning and demonstrate the effectiveness of our AMR method. Source codes are available in https://github.com/duxy-me/AMR.Comment: TKD
    • โ€ฆ
    corecore