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-articleJuly 2021
MULFE: Multi-Label Learning via Label-Specific Feature Space Ensemble
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 16, Issue 1Article No.: 5, Pages 1–24https://doi.org/10.1145/3451392In multi-label learning, label correlations commonly exist in the data. Such correlation not only provides useful information, but also imposes significant challenges for multi-label learning. Recently, label-specific feature embedding has been proposed ...
- research-articleJuly 2021
Short-term Load Forecasting by Using Improved GEP and Abnormal Load Recognition
ACM Transactions on Internet Technology (TOIT), Volume 21, Issue 4Article No.: 95, Pages 1–28https://doi.org/10.1145/3447513Load forecasting in short term is very important to economic dispatch and safety assessment of power system. Although existing load forecasting in short-term algorithms have reached required forecast accuracy, most of the forecasting models are black ...
- research-articleJuly 2021
Collaborative filtering with a deep adversarial and attention network for cross-domain recommendation
Information Sciences: an International Journal (ISCI), Volume 565, Issue CPages 370–389https://doi.org/10.1016/j.ins.2021.02.009AbstractCross-domain recommendation can alleviate the data sparsity problem in the target domain and has become a promising research area. Recently, various models have been proposed to provide recommendation across domains. Some models ...
- research-articleMay 2021
Self-Adaptive Skeleton Approaches to Detect Self-Organized Coalitions From Brain Functional Networks Through Probabilistic Mixture Models
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 15, Issue 5Article No.: 87, Pages 1–26https://doi.org/10.1145/3447570Detecting self-organized coalitions from functional networks is one of the most important ways to uncover functional mechanisms in the brain. Determining these raises well-known technical challenges in terms of scale imbalance, outliers and hard-...
- research-articleJune 2021
Unsupervised Lifelong Learning with Curricula
WWW '21: Proceedings of the Web Conference 2021Pages 3534–3545https://doi.org/10.1145/3442381.3449839Lifelong machine learning (LML) has driven the development of extensive web applications, enabling the learning systems deployed on web servers to deal with a sequence of tasks in an incremental fashion. Such systems can retain knowledge from learned ...
- research-articleMarch 2021
Stacked Convolutional Sparse Auto-Encoders for Representation Learning
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 15, Issue 2Article No.: 31, Pages 1–21https://doi.org/10.1145/3434767Deep learning seeks to achieve excellent performance for representation learning in image datasets. However, supervised deep learning models such as convolutional neural networks require a large number of labeled image data, which is intractable in ...
- research-articleJanuary 2021
A speech-to-knowledge-graph construction system
IJCAI'20: Proceedings of the Twenty-Ninth International Joint Conference on Artificial IntelligenceArticle No.: 777, Pages 5303–5305This paper presents a HAO-Graph system that generates and visualizes knowledge graphs from a speech in real-time. When a user speaks to the system, HAO-Graph transforms the voice into knowledge graphs with key phrases from the original speech as nodes and ...
- research-articleJanuary 2021
Learning interpretable representations with informative entanglements
IJCAI'20: Proceedings of the Twenty-Ninth International Joint Conference on Artificial IntelligenceArticle No.: 273, Pages 1970–1976Learning interpretable representations in an unsupervised setting is an important yet a challenging task. Existing unsupervised interpretable methods focus on extracting independent salient features from data. However they miss out the fact that the ...
- research-articleSeptember 2021
LSBert: Lexical Simplification Based on BERT
IEEE/ACM Transactions on Audio, Speech and Language Processing (TASLP), Volume 29Pages 3064–3076https://doi.org/10.1109/TASLP.2021.3111589Lexical simplification (LS) aims at replacing complex words with simpler alternatives. LS commonly consists of three main steps: complex word identification, substitute generation, and substitute ranking. Existing LS methods focus on the contextual ...
- research-articleMay 2021
Chinese Lexical Simplification
IEEE/ACM Transactions on Audio, Speech and Language Processing (TASLP), Volume 29Pages 1819–1828https://doi.org/10.1109/TASLP.2021.3078361Lexical simplification has attracted much attention in many languages, which is the process of replacing complex words in a given sentence with simpler alternatives of equivalent meaning. Although the richness of vocabulary in Chinese makes the text very ...
- research-articleApril 2021
FSPRM: A Feature Subsequence Based Probability Representation Model for Chinese Word Embedding
IEEE/ACM Transactions on Audio, Speech and Language Processing (TASLP), Volume 29Pages 1702–1716https://doi.org/10.1109/TASLP.2021.3073868Chinese word embedding models capture Chinese semantics based on the character feature of Chinese words and the internal features of Chinese characters such as radical, component, stroke, structure and pinyin. However, some features are overlapping and ...
- research-articleJanuary 2021
Suffix array for multi-pattern matching with variable length wildcards
Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix ...
- research-articleJanuary 2021
Hierarchical features-based targeted aspect extraction from online reviews
With the prevalence of online review websites, large-scale data promote the necessity of focused analysis. This task aims to capture the information that is highly relevant to a specific aspect. However, the broad scope of the aspects of the ...
- research-articleNovember 2020
NetDAP: (δ, γ) −approximate pattern matching with length constraints
Applied Intelligence (KLU-APIN), Volume 50, Issue 11Pages 4094–4116https://doi.org/10.1007/s10489-020-01778-1AbstractPattern matching(PM) with gap constraints has been applied to compute the support of a pattern in a sequence, which is an essential task of the repetitive sequential pattern mining (or sequence pattern mining). Compared with exact PM, approximate ...
- research-articleSeptember 2020
REMIAN: Real-Time and Error-Tolerant Missing Value Imputation
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 14, Issue 6Article No.: 77, Pages 1–38https://doi.org/10.1145/3412364Missing value (MV) imputation is a critical preprocessing means for data mining. Nevertheless, existing MV imputation methods are mostly designed for batch processing, and thus are not applicable to streaming data, especially those with poor quality. In ...
- surveySeptember 2020
Causality-based Feature Selection: Methods and Evaluations
ACM Computing Surveys (CSUR), Volume 53, Issue 5Article No.: 111, Pages 1–36https://doi.org/10.1145/3409382Feature selection is a crucial preprocessing step in data analytics and machine learning. Classical feature selection algorithms select features based on the correlations between predictive features and the class variable and do not attempt to capture ...
- research-articleAugust 2020
Targeted aspects oriented topic modeling for short texts
Applied Intelligence (KLU-APIN), Volume 50, Issue 8Pages 2384–2399https://doi.org/10.1007/s10489-020-01672-wAbstractTopic modeling has demonstrated its value in short text topic discovery. For this task, a common way adopted by many topic models is to perform a full analysis to find all the possible topics. However, these topic models overlook the importance of ...
- research-articleJune 2020
NetNPG: Nonoverlapping pattern matching with general gap constraints
Applied Intelligence (KLU-APIN), Volume 50, Issue 6Pages 1832–1845https://doi.org/10.1007/s10489-019-01616-zAbstractPattern matching (PM) with gap constraints (or flexible wildcards) is one of the essential tasks in repetitive sequential pattern mining (or sequence pattern mining), since it can compute the support of a pattern in a sequence. Nonoverlapping PM (...
- research-articleMay 2020
Time series indexing by dynamic covering with cross-range constraints
The VLDB Journal — The International Journal on Very Large Data Bases (VLDB), Volume 29, Issue 6Pages 1365–1384https://doi.org/10.1007/s00778-020-00614-9AbstractTime series indexing plays an important role in querying and pattern mining of big data. This paper proposes a novel structure for tightly covering a given set of time series under the dynamic time warping similarity measurement. The structure, ...
- research-articleMay 2020
A no self-edge stochastic block model and a heuristic algorithm for balanced anti-community detection in networks
Information Sciences: an International Journal (ISCI), Volume 518, Issue CPages 95–112https://doi.org/10.1016/j.ins.2020.01.005Highlights- A no self-edge stochastic block model (NESOM) is proposed for anti-community structure, which evolves a new objective function for evaluation.
Many real-world networks own the characteristic of anti-community structure, i.e. disassortative structure, where nodes share no or few connections inside their groups but most of their connections outside. Detecting anti-community ...