Using Rich Social Media Information for Music Recommendation via Hypergraph Model

Currently, many of the processing techniques for the location-based queries provide information of a single type of spatial objects, based on their spatial closeness to the query object. However, in real-life applications the user may be interested in obtaining information about different types of objects, in terms of their quality, cost, and neighboring relationship. We term the different types of objects with better quality and closer to each other the Neighboring skyline set (or NS set). Three new types of location-based queries, the Distance-based neighboring skyline query (Dist-NS query), the Cost-based neighboring skyline query (Cost-NS query), and the Budget-based neighboring skyline query (BGT-NS query), are presented to determine the NS sets according to user’s specific requirement. A R-tree-based index, the $$R^{a,c}$$-tree, is first designed to manage each type of objects with their locations, attributes, and costs. Then, a simultaneous traversal of the $$R^{a,c}$$-trees built on different types of objects is employed with several pruning criteria to prune the non-qualifying object sets as early as possible, so as to improve the query performance. Extensive experiments using the synthetic dataset demonstrate the efficiency and the effectiveness of the proposed algorithms.

INTRODUCTION: In an effort to enhance the quality of user experience in using music services and improve the efficiency of music recommendation platforms, researching accurate and efficient music recommendation methods and constructing an accurate real-time online recommendation platform are the key points for the success of a high-quality music website platform.OBJECTIVES: To address the problems of incomplete signal feature capture, insufficient classification efficiency and poor generalization of current music recommendation methods.METHODS: Improve the deep confidence network to construct music recommendation algorithm by using big data and intelligent optimization algorithm. Firstly, music features are extracted by analyzing the principle of music recommendation algorithm, and evaluation indexes of music recommendation algorithm are proposed at the same time; then, combined with the deep sleep optimization algorithm, a music recommendation method based on improved deep confidence network is proposed; finally, the efficiency of the proposed method is verified through the analysis of simulation experiments.RESULTS: While meeting the real-time requirements, the proposed method improves the music recommendation accuracy, recall, and coverage.CONCLUSION: Solves the questions of incomplete signal feature capture, insufficient classification efficiency, and poor generalization of current music recommendation algorithms.

Heterogeneous information networks have drawn much attention in recent years due to their significant applications, such as text mining, e-commerce, social networks, and bioinformatics. Clustering different types of objects simultaneously based upon not only their relations of the same type, but also the relations between different types of objects can improve the clustering quality mutually. In this paper, we propose a general model, in which both the homogeneous and heterogeneous relations are considered simultaneously, to describe the structure of the heterogeneous information networks and devise a novel parametric free multi-type overlapped clustering approach. In this model, different types of relations between different types of objects are represented by a group of matrices. In this way, we transfer the multi-type clustering problem into the information compression problem. Subsequently, greedy search approaches, which aim at describing the group of relational matrices with least bits, are proposed. Moreover, by discovering the discriminative clusters among different types of objects, we devise effective parameter-free strategies to discover either overlapping or non-overlapping structure among different types of clusters. Extensive experiments on real-world and synthetic data sets demonstrate our methods are effective and efficient.

In this paper I argue that music recommendation algorithms are a complex element of contemporary digital culture. We trust music streaming and recommender systems like Spotify to ‘set the mood’ for us, to soundtrack our private lives and activities, to recommend & discover for us. These systems purport to ‘know’ us (alongside the millions of other users), and as such we let them into our most intimate listening spaces and moments. We fetishise and share the datafication of our listening habits, reflected to us annually in Spotify’s “Your 2018 Wrapped” and every Monday in ‘Discover Weekly’, even daily in the “playlists made for you”. As the accuracy of these recommendations increases, so too does our trust in these systems. ‘Bad’ or inaccurate recommendations feel like a betrayal, giving us the sense that the algorithms don’t really know us at all. Users speak of ‘their’ algorithm, as if it belonged to them and not a part of a complex machine learning recommendation system. This paper builds on research which critically examined the music recommendation system that powers Spotify and its many discovery features. The research explored the process through which Spotify automates discovery by incorporating established methods of music consumption, and demonstrated that music recommendation systems such as Spotify are emblematic of the politics of algorithmic culture.

This paper investigates the effects of encumbrance (holding different types of objects while using mobile devices) to understand the interaction difficulties that it causes. An experiment was conducted where participants performed a target acquisition task on a touchscreen mobile phone while carrying different types of bags and boxes. Mobility was also evaluated since people carry items from one place to another. Motion capture hardware was used to track hand and arm postures to examine how holding the different types of objects caused excessive movement and instability therefore resulting in performance to decline. The results showed encumbrance and mobility caused target accuracy to decrease although input while holding the box under the non-dominant arm was more accurate and exerted quicker targeting times than holding no objects. Encumbrance affected the dominant hand more than the non-dominant hand as targeting error significantly increased and caused greater hand instability. The issues caused by encumbrance suggest the topic requires more attention from researchers and users would benefit greatly if better interaction techniques and applications are developed to counteract the problems.

In an object oriented system, different types of objects may have one or more attributes in common. For example different types of objects in a library system might be loanable or catalogued. The first part of the paper introduces a distinction between object types and attribute types, showing that there are advantages in treating them as separate constructs of an object oriented programming language. Then generalized attribute types, (e.g. synchronized, journalized, protected) are discussed. It is shown how implementations involving a technique called bracket routines can lead to clearly modeled and cleanly implemented programs. It is then shown how the bracket technique can be effectively used to introduce protection and security concepts into a system. Among the clear advantages of this technique is that it results in better reusability of code.

The most common way to listen to recorded music nowadays is via streaming platforms, which provide access to tens of millions of tracks. To assist users in effectively browsing these large catalogs, the integration of music recommender systems (MRSs) has become essential. Current real‐world MRSs are often quite complex and optimized for recommendation accuracy. They combine several building blocks based on collaborative filtering and content‐based recommendation. This complexity can hinder the ability to explain recommendations to end users, which is particularly important for recommendations perceived as unexpected or inappropriate. While pure recommendation performance often correlates with user satisfaction, explainability has a positive impact on other factors such as trust and forgiveness, which are ultimately essential to maintain user loyalty.In this article, we discuss how explainability can be addressed in the context of MRSs. We provide perspectives on how explainability could improve music recommendation algorithms and enhance user experience. First, we review common dimensions and goals of recommenders explainability and in general of eXplainable Artificial Intelligence (XAI), and elaborate on the extent to which these apply—or need to be adapted—to the specific characteristics of music consumption and recommendation. Then, we show how explainability components can be integrated within a MRS and in what form explanations can be provided. Since the evaluation of explanation quality is decoupled from pure accuracy‐based evaluation criteria, we also discuss requirements and strategies for evaluating explanations of music recommendations. Finally, we describe the current challenges for introducing explainability within a large‐scale industrial MRS and provide research perspectives.

To enhance the precision of the music recommendation environment system, a novel design approach has been introduced, utilizing multi-label propagation and hierarchical clustering analysis for a dual music recommendation environment. First of all, the process model of music recommendation environmental system is built based on music recognition system, which is composed of music signal preprocessing module, music model, sound model and music recognizer; second, on the basis of further study on the clustering validity, a new clustering validity function is established by describing the intra-class compactness and inter-class separation of clustering through fuzzy similarity relation; finally, the validity of the proposed music double recommendation environmental system using multi-label propagation hierarchical clustering analysis is verified by simulation experiment. The results show that the recommendation method based on comprehensive evaluation of user characteristics is suitable for single-category users, while the recommendation method based on multi-category evaluation is suitable for multi-category users. This approach offers an effective and precise means to enhance the accuracy and customization of music recommendation systems, thereby increasing user satisfaction.

본 논문에서는 소셜 음악 사이트에서 사용자들이 생성한 태그를 바탕으로 음악을 추천하는 기법을 제안한다. 협력적 태깅 시스템은 사용자가 직접 선정한 단어를 콘텐츠에 부여할 수 있도록 하므로, 사용자의 선호도를 구체적으로 파악할 수 있는 정보를 제공한다. 특히, 감정을 표현하는 감정 태그들은 음악 장르나 음악가와 같이 사실을 나타내는 사실 태그들과는 다르게 선호도를 훨씬 직접 표현하고 있다. 따라서 태그의 의미를 파악하여 감정 태그와 사실 태그로 분류하고, 감정 태그는 감정표현의 정도에 따라 가중치를 부여하기 위해서 UniTag라고 하는 태그 온톨로지를 개발하였다. UniTag 온톨로지를 이용하여 정제된 태그 집합은 사용자 프로파일 생성에 사용되며, 태그 기반 사용자 프로파일을 바탕으로 음악 추천 알고리즘을 수행하였다. 제안하는 추천 방법의 효율성을 평가하기 위해서, 전통적인 청취 횟수 기반 추천, 감정 태그 가중치를 고려하지 않은 추천, 그리고 감정 태그 가중치를 고려한 추천의 세 가지 추천 방법의 정확도와 재현율을 비교하였다. 실험 결과는, 감정 태그 가중치를 고려한 추천 방식이 정확도의 측면에서 다른 두 가지 방식보다 효율적이라는 것을 보여준다. In this paper, we propose a music recommendation method considering users' tags by collaborative tagging in a social music site. Since collaborative tagging allows a user to add keywords chosen by himself to web resources, it provides users' preference about the web resources concretely. In particular, emotional tags which represent human's emotion contain users' musical preference more directly than factual tags which represent facts such as musical genre and artists. Therefore, to classify the tags into the emotional tags and the factual tags and to assign weighted values to the emotional tags, a tag ontology called UniTag is developed. After preprocessing the tags, the weighted tags are used to create user profiles, and the music recommendation algorithm is executed based on the profiles. To evaluate the proposed method, a conventional playcount-based recommendation, an unweighted tag-based recommendation, and an weighted tag-based recommendation are executed. Our experimental results show that the weighted tag-based recommendation outperforms other two approaches in terms of precision.

High-Order Co-Clustering (HOCC) methods have attracted high attention in recent years because of their ability to cluster multiple types of objects simultaneously using all available information. During the clustering process, HOCC methods exploit object co-occurrence information, i.e., inter-type relationships amongst different types of objects as well as object affinity information, i.e., intra-type relationships amongst the same types of objects. However, it is difficult to learn accurate intra-type relationships in the presence of noise and outliers. Existing HOCC methods consider the p nearest neighbours based on Euclidean distance for the intra-type relationships, which leads to incomplete and inaccurate intra-type relationships. In this paper, we propose a novel HOCC method that incorporates multiple subspace learning with a heterogeneous manifold ensemble to learn complete and accurate intra-type relationships. Multiple subspace learning reconstructs the similarity between any pair of objects that belong to the same subspace. The heterogeneous manifold ensemble is created based on two-types of intra-type relationships learnt using p-nearest-neighbour graph and multiple subspaces learning. Moreover, in order to make sure the robustness of clustering process, we introduce a sparse error matrix into matrix decomposition and develop a novel iterative algorithm. Empirical experiments show that the proposed method achieves improved results over the state-of-art HOCC methods for FScore and NMI.

Heterogeneous object co-clustering has become an important research topic in data mining. In early years of this research, people mainly worked on two types of heterogeneous data (denoted by pair-wise co-clustering); while recently more and more attention was paid to multiple types of heterogeneous data (denoted by high- order co-clustering). In this paper, we studied the high- order co-clustering of objects with star-structured interrelationship, i.e., there is a central type of objects that connects the other types of objects. Actually, this case could be a very good model for many real-world applications, such as the co-clustering of Web images, their low-level visual features, and the surrounding text. We used a tripartite graph to represent the interrelationships among different objects, and proposed a consistent information theory which generates an effective algorithm to obtain the co-clusters of different types of objects. Experiments on a Web image show that our proposed algorithm is a better choice compared with previous work on heterogeneous object co-clustering.

Recently, many computational models have been proposed to simulate visual cognition process. For example, the hierarchical Max-Pooling (HMAX) model was proposed according to the hierarchical and bottom-up structure of V1 to V4 in the ventral pathway of primate visual cortex, which could achieve position- and scale-tolerant recognition. In our previous work, we have introduced memory and association into the HMAX model to simulate visual cognition process. In this paper, we improve our theoretical framework by mimicking a more elaborate structure and function of the primate visual cortex. We will mainly focus on the new formation of memory and association in visual processing under different circumstances as well as preliminary cognition and active adjustment in the inferior temporal cortex, which are absent in the HMAX model. The main contributions of this paper are: 1) in the memory and association part, we apply deep convolutional neural networks to extract various episodic features of the objects since people use different features for object recognition. Moreover, to achieve a fast and robust recognition in the retrieval and association process, different types of features are stored in separated clusters and the feature binding of the same object is stimulated in a loop discharge manner and 2) in the preliminary cognition and active adjustment part, we introduce preliminary cognition to classify different types of objects since distinct neural circuits in a human brain are used for identification of various types of objects. Furthermore, active cognition adjustment of occlusion and orientation is implemented to the model to mimic the top-down effect in human cognition process. Finally, our model is evaluated on two face databases CAS-PEAL-R1 and AR. The results demonstrate that our model exhibits its efficiency on visual recognition process with much lower memory storage requirement and a better performance compared with the traditional purely computational methods.

The problem of routing between two types of objects is considered. Two variants of the problem statement are considered: with a single point of collection and without it. An important aspect of the routes is the mandatory alternation of different types of objects. A mathematical model of the problem with boolean variables is proposed for each statement. A meaningful statement can be represented as the task of collecting haystacks in trucks afield. Two algorithms are developed to solve this problem. The first one is based on the “greedy” strategies, and the second one is based on the approach of Ant Colony Optimization (ACO) algorithms. To configure the parameters of the second algorithm it is carried out the computational experiment. The results of the experiment are provided. In conclusion, the main results of the work are presented.

The SiamFC target tracking algorithm has attracted extensive attention because of its good balance between speed and performance, but the tracking effect of the SiamFC algorithm is not satisfactory in complex background scenes. When SiamFC algorithm uses deep semantic features for tracking, it has good recognition ability for different types of objects, but it has insufficient discrimination for the same types of objects. Therefore, we propose an effective anti-interference module to improve the discrimination ability of the algorithm. The anti-interference module uses another feature extraction network to extract the features of the candidate target images generated by the SiamFC main network. In addition, we set up the feature vector set to save the feature vectors of the tracking target and the template image. Finally, the tracking target is selected by calculating the minimum cosine distance between the feature vector of the candidate target and the vector in the feature vector set. A large number of experiments show that our anti-interference module can effectively improve the performance of SiamFC algorithm, and the performance of this algorithm can be comparable to the popular algorithms.

Heterogeneous networks are useful for modeling complex systems that consist of different types of objects. However, there are limited statistical models to deal with heterogeneous networks. In this paper, we propose a statistical model for community detection in heterogeneous networks. We formulate a heterogeneous version of the mixed membership stochastic blockmodel to accommodate heterogeneity in the data and the content dependent property of the pairwise relationship. We also apply a variational algorithm for posterior inference. The proposed procedure is shown to be consistent for community detection under mixed membership stochastic blockmodels for heterogeneous networks. We demonstrate the advantage of the proposed method in modeling overlapping communities and multiple memberships through simulation studies and applications to a real data set.