17,076 research outputs found
Hete-CF: Social-Based Collaborative Filtering Recommendation using Heterogeneous Relations
Collaborative filtering algorithms haven been widely used in recommender
systems. However, they often suffer from the data sparsity and cold start
problems. With the increasing popularity of social media, these problems may be
solved by using social-based recommendation. Social-based recommendation, as an
emerging research area, uses social information to help mitigate the data
sparsity and cold start problems, and it has been demonstrated that the
social-based recommendation algorithms can efficiently improve the
recommendation performance. However, few of the existing algorithms have
considered using multiple types of relations within one social network. In this
paper, we investigate the social-based recommendation algorithms on
heterogeneous social networks and proposed Hete-CF, a Social Collaborative
Filtering algorithm using heterogeneous relations. Distinct from the exiting
methods, Hete-CF can effectively utilize multiple types of relations in a
heterogeneous social network. In addition, Hete-CF is a general approach and
can be used in arbitrary social networks, including event based social
networks, location based social networks, and any other types of heterogeneous
information networks associated with social information. The experimental
results on two real-world data sets, DBLP (a typical heterogeneous information
network) and Meetup (a typical event based social network) show the
effectiveness and efficiency of our algorithm
Deep Learning Framework for Online Interactive Service Recommendation in Iterative Mashup Development
Recent years have witnessed the rapid development of service-oriented
computing technologies. The boom of Web services increases the selection burden
of software developers in developing service-based systems (such as mashups).
How to recommend suitable follow-up component services to develop new mashups
has become a fundamental problem in service-oriented software engineering. Most
of the existing service recommendation approaches are designed for mashup
development in the single-round recommendation scenario. It is hard for them to
update recommendation results in time according to developers' requirements and
behaviors (e.g., instant service selection). To address this issue, we propose
a deep-learning-based interactive service recommendation framework named DLISR,
which aims to capture the interactions among the target mashup, selected
services, and the next service to recommend. Moreover, an attention mechanism
is employed in DLISR to weigh selected services when recommending the next
service. We also design two separate models for learning interactions from the
perspectives of content information and historical invocation information,
respectively, as well as a hybrid model called HISR. Experiments on a
real-world dataset indicate that HISR outperforms several state-of-the-art
service recommendation methods in the online interactive scenario for
developing new mashups iteratively.Comment: 15 pages, 6 figures, and 3 table
KGAT: Knowledge Graph Attention Network for Recommendation
To provide more accurate, diverse, and explainable recommendation, it is
compulsory to go beyond modeling user-item interactions and take side
information into account. Traditional methods like factorization machine (FM)
cast it as a supervised learning problem, which assumes each interaction as an
independent instance with side information encoded. Due to the overlook of the
relations among instances or items (e.g., the director of a movie is also an
actor of another movie), these methods are insufficient to distill the
collaborative signal from the collective behaviors of users. In this work, we
investigate the utility of knowledge graph (KG), which breaks down the
independent interaction assumption by linking items with their attributes. We
argue that in such a hybrid structure of KG and user-item graph, high-order
relations --- which connect two items with one or multiple linked attributes
--- are an essential factor for successful recommendation. We propose a new
method named Knowledge Graph Attention Network (KGAT) which explicitly models
the high-order connectivities in KG in an end-to-end fashion. It recursively
propagates the embeddings from a node's neighbors (which can be users, items,
or attributes) to refine the node's embedding, and employs an attention
mechanism to discriminate the importance of the neighbors. Our KGAT is
conceptually advantageous to existing KG-based recommendation methods, which
either exploit high-order relations by extracting paths or implicitly modeling
them with regularization. Empirical results on three public benchmarks show
that KGAT significantly outperforms state-of-the-art methods like Neural FM and
RippleNet. Further studies verify the efficacy of embedding propagation for
high-order relation modeling and the interpretability benefits brought by the
attention mechanism.Comment: KDD 2019 research trac
GREASE: A Generative Model for Relevance Search over Knowledge Graphs
Relevance search is to find top-ranked entities in a knowledge graph (KG)
that are relevant to a query entity. Relevance is ambiguous, particularly over
a schema-rich KG like DBpedia which supports a wide range of different
semantics of relevance based on numerous types of relations and attributes. As
users may lack the expertise to formalize the desired semantics, supervised
methods have emerged to learn the hidden user-defined relevance from
user-provided examples. Along this line, in this paper we propose a novel
generative model over KGs for relevance search, named GREASE. The model applies
to meta-path based relevance where a meta-path characterizes a particular type
of semantics of relating the query entity to answer entities. It is also
extended to support properties that constrain answer entities. Extensive
experiments on two large-scale KGs demonstrate that GREASE has advanced the
state of the art in effectiveness, expressiveness, and efficiency.Comment: 9 pages, accepted to WSDM 202
- …