Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Reflects downloads up to 09 Nov 2024Bibliometrics
Skip Table Of Content Section
research-article
Modeling Cross-session Information with Multi-interest Graph Neural Networks for the Next-item Recommendation
Article No.: 1, Pages 1–28https://doi.org/10.1145/3532192

Next-item recommendation involves predicting the next item of interest of a given user from their past behavior. Users tend to browse and purchase various items on e-commerce websites according to their varied interests and needs, as reflected in their ...

research-article
A Self-Representation Method with Local Similarity Preserving for Fast Multi-View Outlier Detection
Article No.: 2, Pages 1–20https://doi.org/10.1145/3532191

With the rapidly growing attention to multi-view data in recent years, multi-view outlier detection has become a rising field with intense research. These researches have made some success, but still exist some issues that need to be solved. First, many ...

research-article
Learning Aspect-Aware High-Order Representations from Ratings and Reviews for Recommendation
Article No.: 3, Pages 1–22https://doi.org/10.1145/3532188

Textual reviews contain rich semantic information that is useful for making better recommendation, as such semantic information may indicate more fine-grained preferences of users. Recent efforts make considerable improvement on recommendation by ...

research-article
Integrating Global and Local Feature Selection for Multi-Label Learning
Article No.: 4, Pages 1–37https://doi.org/10.1145/3532190

Multi-label learning deals with the problem where an instance is associated with multiple labels simultaneously. Multi-label data is often of high dimensionality and has many noisy, irrelevant, and redundant features. As an important machine learning task,...

research-article
An Efficient Aggregation Method for the Symbolic Representation of Temporal Data
Article No.: 5, Pages 1–22https://doi.org/10.1145/3532622

Symbolic representations are a useful tool for the dimension reduction of temporal data, allowing for the efficient storage of and information retrieval from time series. They can also enhance the training of machine learning algorithms on time series ...

research-article
Semi-Supervised Graph Pattern Matching and Rematching for Expert Community Location
Article No.: 6, Pages 1–26https://doi.org/10.1145/3532623

Graph pattern matching (GPM) is widely used in social network analysis, such as expert finding, social group query, and social position detection. Technically, GPM is to find matched subgraphs that meet the requirements of pattern graphs in big social ...

research-article
Individuality Meets Commonality: A Unified Graph Learning Framework for Multi-View Clustering
Article No.: 7, Pages 1–21https://doi.org/10.1145/3532612

Multi-view clustering, which aims at boosting the clustering performance by leveraging the individual information and the common information of multi-view data, has gained extensive consideration in recent years. However, most existing multi-view ...

research-article
SigGAN: Adversarial Model for Learning Signed Relationships in Networks
Article No.: 8, Pages 1–20https://doi.org/10.1145/3532610

Signed link prediction in graphs is an important problem that has applications in diverse domains. It is a binary classification problem that predicts whether an edge between a pair of nodes is positive or negative. Existing approaches for link prediction ...

research-article
Open Access
Dynamic Graph Convolutional Recurrent Network for Traffic Prediction: Benchmark and Solution
Article No.: 9, Pages 1–21https://doi.org/10.1145/3532611

Traffic prediction is the cornerstone of intelligent transportation system. Accurate traffic forecasting is essential for the applications of smart cities, i.e., intelligent traffic management and urban planning. Although various methods are proposed for ...

research-article
US-Rule: Discovering Utility-driven Sequential Rules
Article No.: 10, Pages 1–22https://doi.org/10.1145/3532613

Utility-driven mining is an important task in data science and has many applications in real life. High-utility sequential pattern mining (HUSPM) is one kind of utility-driven mining. It aims at discovering all sequential patterns with high utility. ...

research-article
Multi-Concept Representation Learning for Knowledge Graph Completion
Article No.: 11, Pages 1–19https://doi.org/10.1145/3533017

Knowledge Graph Completion (KGC) aims at inferring missing entities or relations by embedding them in a low-dimensional space. However, most existing KGC methods generally fail to handle the complex concepts hidden in triplets, so the learned embeddings ...

research-article
Open Access
Unsupervised Graph-Based Entity Resolution for Complex Entities
Article No.: 12, Pages 1–30https://doi.org/10.1145/3533016

Entity resolution (ER) is the process of linking records that refer to the same entity. Traditionally, this process compares attribute values of records to calculate similarities and then classifies pairs of records as referring to the same entity or not ...

research-article
Explainability-Based Mix-Up Approach for Text Data Augmentation
Article No.: 13, Pages 1–14https://doi.org/10.1145/3533048

Text augmentation is a strategy for increasing the diversity of training examples without explicitly collecting new data. Owing to the efficiency and effectiveness of text augmentation, numerous augmentation methodologies have been proposed. Among them, ...

research-article
Be Causal: De-Biasing Social Network Confounding in Recommendation
Article No.: 14, Pages 1–23https://doi.org/10.1145/3533725

In recommendation systems, the existence of the missing-not-at-random (MNAR) problem results in the selection bias issue, degrading the recommendation performance ultimately. A common practice to address MNAR is to treat missing entries from the so-called ...

tutorial
Open Access
A Survey on Deep Hashing Methods
Article No.: 15, Pages 1–50https://doi.org/10.1145/3532624

Nearest neighbor search aims at obtaining the samples in the database with the smallest distances from them to the queries, which is a basic task in a range of fields, including computer vision and data mining. Hashing is one of the most widely used ...

Subjects

Comments