Titlebook: Database Systems for Advanced Applications; 23rd International C Jian Pei,Yannis Manolopoulos,Jianxin Li Conference proceedings 2018 Spring

纺织品

Isosmotic Fluid Transport across Epithelia,al information including the microscopic proximity structure and mesoscopic community structure. In particular, both the microscopic proximity structure and node attributes are factorized by Nonnegative Matrix Factorization (NMF), from which the low-dimensional node representations can be obtained.

搬运工

吞噬

Female Circumcision/Mutilation/Cuttingeference modeling in the collaborative filtering framework..To address the limitations of existing methods, we propose a . (CGA) model, which can integrate context information encoded in different context graphs with the attention mechanism for POI recommendation. CGA first uses two context-aware at

惊惶

Olusegun Badejoko,Uchenna Onwudiegwug the next question in the interview process. Second, the interview item set in the decision tree based methods is very small (i.e., usually less than 50 items), which leads to that the interview items cannot fully reflect or capture the diverse user interests, and most items do not have the opportu

FORGO

Osric Banfegha Navti,Victor N. Chilakameaningful yet compact high level features of clothing items, which are represented as binary hash codes. In detail, this learning process is supervised by a clothing matching matrix, which is initially constructed based on limited known matching pairs and subsequently on the self-augmented ones. Th

CHIP

https://doi.org/10.1007/978-3-030-14105-9t feature mapping is proposed to transfer the latent features of a cold-start user from the auxiliary domain to the target domain. Extensive experiments on two real datasets extracted from Amazon transaction data demonstrate the superiority of our proposed model against other state-of-the-art method

Aprope

James W. McAuley,Paul Nesbitt-Larking theoretically and empirically. Our results show that the algorithm is highly efficient and scalable. It outperforms adapted state-of-the-art nearest neighbor algorithms in both precomputation and query processing costs by more than one order of magnitude.

overreach

过份艳丽

https://doi.org/10.1007/978-3-319-28100-1on of the new paradigm and can be implemented easily by using the fundamental external memory primitives. We conduct extensive experiments on real and synthesis graphs and the results demonstrate the efficiency of our proposed algorithm.

ITCH