Arrow Research search

Author name cluster

Xiaohui Yan

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

6 papers
1 author row

Possible papers

6

EAAI Journal 2023 Journal Article

A nearly end-to-end deep learning approach to fault diagnosis of wind turbine gearboxes under nonstationary conditions

  • Liangwei Zhang
  • Qi Fan
  • Jing Lin
  • Zhicong Zhang
  • Xiaohui Yan
  • Chuan Li

Fault diagnosis of wind turbine gearboxes is crucial in ensuring wind farms’ reliability and safety. However, nonstationary working conditions, such as load change or speed regulation, may result in an accuracy deterioration of many existing fault diagnosis approaches. To overcome the issue, this research proposes a nearly end-to-end deep learning approach to fault diagnosis of wind turbine gearboxes using vibration signals. Concretely, we adopt Empirical Mode Decomposition (EMD) to decompose vibration signals into a series of Intrinsic Mode Functions (IMFs). Then, the multi-channel IMFs are fed into a 1D Convolutional Neural Network (CNN) for automatic feature learning and fault classification. Since EMD is a signal processing technique requiring no prior knowledge, the model architecture can be viewed as nearly end-to-end. The proposed approach was validated in a real-world dataset; it proved deep learning models have an overwhelming advantage in representation capacity over traditional shallow models. It also demonstrated that the introduction of EMD as a preprocessing step improves both the training efficiency and the generalization ability of a deep model, thus leading to a better fault diagnosis efficacy under variable working conditions.

AAAI Conference 2020 Conference Paper

Convolutional Hierarchical Attention Network for Query-Focused Video Summarization

  • Shuwen Xiao
  • Zhou Zhao
  • Zijian Zhang
  • Xiaohui Yan
  • Min Yang

Previous approaches for video summarization mainly concentrate on finding the most diverse and representative visual contents as video summary without considering the user’s preference. This paper addresses the task of query-focused video summarization, which takes user’s query and a long video as inputs and aims to generate a query-focused video summary. In this paper, we consider the task as a problem of computing similarity between video shots and query. To this end, we propose a method, named Convolutional Hierarchical Attention Network (CHAN), which consists of two parts: feature encoding network and query-relevance computing module. In the encoding network, we employ a convolutional network with local self-attention mechanism and query-aware global attention mechanism to learns visual information of each shot. The encoded features will be sent to query-relevance computing module to generate queryfocused video summary. Extensive experiments on the benchmark dataset demonstrate the competitive performance and show the effectiveness of our approach.

AAAI Conference 2020 Conference Paper

Graph LSTM with Context-Gated Mechanism for Spoken Language Understanding

  • Linhao Zhang
  • Dehong Ma
  • Xiaodong Zhang
  • Xiaohui Yan
  • Houfeng Wang

Much research in recent years has focused on spoken language understanding (SLU), which usually involves two tasks: intent detection and slot filling. Since Yao et al. (2013), almost all SLU systems are RNN-based, which have been shown to suffer various limitations due to their sequential nature. In this paper, we propose to tackle this task with Graph LSTM, which first converts text into a graph and then utilizes the message passing mechanism to learn the node representation. Not only the Graph LSTM addresses the limitations of sequential models, but it can also help to utilize the semantic correlation between slot and intent. We further propose a context-gated mechanism to make better use of context information for slot filling. Our extensive evaluation shows that the proposed model outperforms the state-of-the-art results by a large margin.

AAAI Conference 2019 Conference Paper

An Integral Tag Recommendation Model for Textual Content

  • Shijie Tang
  • Yuan Yao
  • Suwei Zhang
  • Feng Xu
  • Tianxiao Gu
  • Hanghang Tong
  • Xiaohui Yan
  • Jian Lu

Recommending suitable tags for online textual content is a key building block for better content organization and consumption. In this paper, we identify three pillars that impact the accuracy of tag recommendation: (1) sequential text modeling meaning that the intrinsic sequential ordering as well as different areas of text might have an important implication on the corresponding tag(s), (2) tag correlation meaning that the tags for a certain piece of textual content are often semantically correlated with each other, and (3) content-tag overlapping meaning that the vocabularies of content and tags are overlapped. However, none of the existing methods consider all these three aspects, leading to a suboptimal tag recommendation. In this paper, we propose an integral model to encode all the three aspects in a coherent encoder-decoder framework. In particular, (1) the encoder models the semantics of the textual content via Recurrent Neural Networks with the attention mechanism, (2) the decoder tackles the tag correlation with a prediction path, and (3) a shared embedding layer and an indicator function across encoder-decoder address the content-tag overlapping. Experimental results on three realworld datasets demonstrate that the proposed method significantly outperforms the existing methods in terms of recommendation accuracy.

AAAI Conference 2019 Conference Paper

Hashtag Recommendation for Photo Sharing Services

  • Suwei Zhang
  • Yuan Yao
  • Feng Xu
  • Hanghang Tong
  • Xiaohui Yan
  • Jian Lu

Hashtags can greatly facilitate content navigation and improve user engagement in social media. Meaningful as it might be, recommending hashtags for photo sharing services such as Instagram and Pinterest remains a daunting task due to the following two reasons. On the endogenous side, posts in photo sharing services often contain both images and text, which are likely to be correlated with each other. Therefore, it is crucial to coherently model both image and text as well as the interaction between them. On the exogenous side, hashtags are generated by users and different users might come up with different tags for similar posts, due to their different preference and/or community effect. Therefore, it is highly desirable to characterize the users’ tagging habits. In this paper, we propose an integral and effective hashtag recommendation approach for photo sharing services. In particular, the proposed approach considers both the endogenous and exogenous effects by a content modeling module and a habit modeling module, respectively. For the content modeling module, we adopt the parallel co-attention mechanism to coherently model both image and text as well as the interaction between them; for the habit modeling module, we introduce an external memory unit to characterize the historical tagging habit of each user. The overall hashtag recommendations are generated on the basis of both the post features from the content modeling module and the habit influences from the habit modeling module. We evaluate the proposed approach on real Instagram data. The experimental results demonstrate that the proposed approach significantly outperforms the state-of-theart methods in terms of recommendation accuracy, and that both content modeling and habit modeling contribute significantly to the overall recommendation accuracy.

AAAI Conference 2015 Conference Paper

A Probabilistic Model for Bursty Topic Discovery in Microblogs

  • Xiaohui Yan
  • Jiafeng Guo
  • Yanyan Lan
  • Jun Xu
  • Xueqi Cheng

Bursty topics discovery in microblogs is important for people to grasp essential and valuable information. However, the task is challenging since microblog posts are particularly short and noisy. This work develops a novel probabilistic model, namely Bursty Biterm Topic Model (BBTM), to deal with the task. BBTM extends the Biterm Topic Model (BTM) by incorporating the burstiness of biterms as prior knowledge for bursty topic modeling, which enjoys the following merits: 1) It can well solve the data sparsity problem in topic modeling over short texts as the same as BTM; 2) It can automatical discover high quality bursty topics in microblogs in a principled and efficient way. Extensive experiments on a standard Twitter dataset show that our approach outperforms the state-of-the-art baselines significantly.