Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2022
The Evolution of Search: Three Computing Paradigms
ACM Transactions on Management Information Systems (TMIS), Volume 13, Issue 2Article No.: 20, Pages 1–20https://doi.org/10.1145/3495214Search is probably the most common activity that humans conduct all the time. A search target can be a concrete item (with a yes or no answer and location information), an abstract concept (such as the most important information on the Web about Xindong ...
- research-articleMarch 2022
PSL: An Algorithm for Partial Bayesian Network Structure Learning
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 16, Issue 5Article No.: 93, Pages 1–25https://doi.org/10.1145/3508071Learning partial Bayesian network (BN) structure is an interesting and challenging problem. In this challenge, it is computationally expensive to use global BN structure learning algorithms, while only one part of a BN structure is interesting, local BN ...
- research-articleMarch 2022
Online Scalable Streaming Feature Selection via Dynamic Decision
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 16, Issue 5Article No.: 87, Pages 1–20https://doi.org/10.1145/3502737Feature selection is one of the core concepts in machine learning, which hugely impacts the model’s performance. For some real-world applications, features may exist in a stream mode that arrives one by one over time, while we cannot know the exact number ...
- research-articleFebruary 2022
OWSP-Miner: Self-adaptive One-off Weak-gap Strong Pattern Mining
ACM Transactions on Management Information Systems (TMIS), Volume 13, Issue 3Article No.: 25, Pages 1–23https://doi.org/10.1145/3476247Gap constraint sequential pattern mining (SPM), as a kind of repetitive SPM, can avoid mining too many useless patterns. However, this method is difficult for users to set a suitable gap without prior knowledge and each character is considered to have the ...
- research-articleJanuary 2022
DGDFS: Dependence Guided Discriminative Feature Selection for Predicting Adverse Drug-Drug Interaction
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 34, Issue 1Pages 271–285https://doi.org/10.1109/TKDE.2020.2978055Adverse drug-drug interaction (ADDI) is referred to as a situation where the unpleasant or adverse effects caused by the co-administration of two drugs, which becomes a significant problem for public health. With the increasing availability of healthcare ...
- research-articleDecember 2021
Representation learning with collaborative autoencoder for personalized recommendation
Expert Systems with Applications: An International Journal (EXWA), Volume 186, Issue Chttps://doi.org/10.1016/j.eswa.2021.115825AbstractIn the past decades, recommendation systems have provided lots of valuable personalized suggestions for the users to address the problem of information over-loaded. Collaborative Filtering (CF) is one of the most commonly applied and successful ...
Highlights- Two different autoencoders are used to capture characteristics for users and items.
- Manifold regularization is integrated into autoencoder for user’s features learning.
- The comprehensive experiments evaluate the effectiveness of ...
- research-articleDecember 2021
Shared-view and specific-view information extraction for recommendation
Expert Systems with Applications: An International Journal (EXWA), Volume 186, Issue Chttps://doi.org/10.1016/j.eswa.2021.115752AbstractIn various recommender systems, ratings and reviews are the main information to show user preferences. However, recommendation models that only use ratings, such as collaborative filtering, are vulnerable to data sparsity. And models only using ...
Highlights- Mining information in reviews and interaction data from shared and specific views.
- Utilizing the confusion adversarial loss to extract the shared features.
- Enforcing orthogonal constraints to extract the specific features.
- ...
- research-articleDecember 2021
HAOP-Miner: Self-adaptive high-average utility one-off sequential pattern mining
Expert Systems with Applications: An International Journal (EXWA), Volume 184, Issue Chttps://doi.org/10.1016/j.eswa.2021.115449Highlights- Address self-adaptive HAOP mining which can discover extremely important patterns.
One-off sequential pattern mining (SPM) (or SPM under the one-off condition) is a kind of repetitive SPM with gap constraints, and has been widely applied in many fields. However, current research on one-off SPM ignores the utility (...
- research-articleNovember 2021
A Dynamic Convolutional Neural Network Based Shared-Bike Demand Forecasting Model
ACM Transactions on Intelligent Systems and Technology (TIST), Volume 12, Issue 6Article No.: 70, Pages 1–24https://doi.org/10.1145/3447988Bike-sharing systems are becoming popular and generate a large volume of trajectory data. In a bike-sharing system, users can borrow and return bikes at different stations. In particular, a bike-sharing system will be affected by weather, the time period, ...
- ArticleNovember 2021
A Weak Supervision Approach with Adversarial Training for Named Entity Recognition
PRICAI 2021: Trends in Artificial IntelligencePages 17–30https://doi.org/10.1007/978-3-030-89363-7_2AbstractNamed entity recognition (NER) is a basic task of natural language processing (NLP), whose purpose is to identify named entities such as the names of persons, places, and organizations in the corpus. Utilizing neural networks for feature ...
- ArticleNovember 2021
High-Quality Noise Detection for Knowledge Graph Embedding with Rule-Based Triple Confidence
PRICAI 2021: Trends in Artificial IntelligencePages 572–585https://doi.org/10.1007/978-3-030-89188-6_43AbstractKnowledge representation learning is usually used in knowledge reasoning and other related fields. Its goal is to use low-dimensional vectors to represent the entities and relations in a knowledge graph. In the process of automatic knowledge graph ...
- short-paperOctober 2021
HAO Unity: A Graph-based System for Unifying Heterogeneous Data
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge ManagementPages 4725–4729https://doi.org/10.1145/3459637.3481991Many real-world applications have to face the problem of diversity in data formats and semantics. Currently, how to deal with heterogeneous data effectively is still a big challenge. With the rise of knowledge graphs, more and more applications are ...
- short-paperOctober 2021
A Chinese Knowledge Base Question Answering System
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge ManagementPages 4813–4816https://doi.org/10.1145/3459637.3481970This paper presents a HAO-Interaction question answering system, which exploits knowledge based question answering (KBQA) technology to quickly obtain an answer path for the input question, and then a creative text generation mechanism to acquire the ...
- research-articleOctober 2021
Social Group Query Based on Multi-Fuzzy-Constrained Strong Simulation
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 16, Issue 3Article No.: 54, Pages 1–27https://doi.org/10.1145/3481640Traditional social group analysis mostly uses interaction models, event models, or other social network analysis methods to identify and distinguish groups. This type of method can divide social participants into different groups based on their geographic ...
- research-articleOctober 2021
NTP-Miner: Nonoverlapping Three-Way Sequential Pattern Mining
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 16, Issue 3Article No.: 51, Pages 1–21https://doi.org/10.1145/3480245Nonoverlapping sequential pattern mining is an important type of sequential pattern mining (SPM) with gap constraints, which not only can reveal interesting patterns to users but also can effectively reduce the search space using the Apriori (anti-...
- research-articleOctober 2021
Multi-label text classification via joint learning from label embedding and label correlation
Neurocomputing (NEUROC), Volume 460, Issue CPages 385–398https://doi.org/10.1016/j.neucom.2021.07.031AbstractFor the multi-label text classification problems with many classes, many existing multi-label classification algorithms become infeasible or suffer an unaffordable cost. Some researches hence perform the Label Space Dimension Reduction(...
- research-articleOctober 2021
HANP-Miner: High average utility nonoverlapping sequential pattern mining
AbstractNonoverlapping sequential pattern mining (SPM) is a data analysis task, which aims at identifying repetitive sequential patterns with gap constraint in a set of discrete sequences. Nonoverlapping means that any character in the ...
- research-articleSeptember 2021
A coarse-to-fine collective entity linking method for heterogeneous information networks▪
AbstractLinking ambiguous entity mentions in a text with their true mapping entities in a heterogeneous information network (HIN) is important. Most of existing entity linking methods with HINs assume that the entities in a text are ...
- research-articleSeptember 2021
Which, Who and How: Detecting fraudulent sale accumulation behavior from multi-dimensional sparse data
- Jiaoling Zheng,
- Shaojie Qiao,
- Nan Han,
- Jianbin Huang,
- Kun Yue,
- Qiang He,
- Shengjie Min,
- Guanghua Ying,
- Xindong Wu
AbstractIn a distribution channel, product manufacturers will reward retail traders who achieve a high value of sales. In order to obtain reward from the manufacturer, distributors might form an alliance where a cheating retail trader could accumulate ...
Highlights- Detecting sale accumulation behavior from multi-dimensional sparse data.
- Proposing a new concept of partially ordered lattice of the data warehouse schema.
- Proposing sale accumulation mining algorithms and sale accumulation pattern ...
- research-articleSeptember 2021
Local Graph Edge Partitioning
ACM Transactions on Intelligent Systems and Technology (TIST), Volume 12, Issue 5Article No.: 61, Pages 1–25https://doi.org/10.1145/3466685Graph edge partitioning, which is essential for the efficiency of distributed graph computation systems, divides a graph into several balanced partitions within a given size to minimize the number of vertices to be cut. Existing graph partitioning models ...