Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haihui Tan

dblp:196/0832 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-2471-6199ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 77% Data mining · 23%
Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › value-based reinforcement learning
q-learning
0.312017
Neural Network based Reinforcement Learning for Real-time Pushing on Text Stream · SIGIR 2017
Information retrieval › text summarization › temporal summarization
real-time summarization
0.312017
Neural Network based Reinforcement Learning for Real-time Pushing on Text Stream · SIGIR 2017
Data mining › text mining
text stream mining
0.112017
Neural Network based Reinforcement Learning for Real-time Pushing on Text Stream · SIGIR 2017

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 0.6q-network · 0.6LSTM · 0.6
YearPublicationVenuePosition
2023 A lightweight network of near cotton-coloured impurity detection method in raw cotton based on weighted feature fusion
abstract
Abstract The objective is to improve the recognition rate of white and near cotton‐coloured impurities in raw cotton against a single white visible light source background. A lightweight detection network model without anchor boxes based on improved YOLO v4‐tiny is proposed in this paper based on weighted feature fusion (WFF). The WFF strategy was used to improve the detection accuracy of the improved YOLO v4‐tiny algorithm. Meanwhile, to address the disadvantage that the anchor boxes obtained by the K‐means algorithm clustering do not have global features, the anchor‐free and tiny decoupled head schemes are used instead of the traditional coupled detection head. The improved algorithm was validated on the PASCAL VOC2012 dataset and the self‐built raw cotton impurity dataset collected by high‐speed camera. On the raw cotton impurity test set, compared to the original YOLO v4‐tiny model, the mean average precision (mAP) and frames per second (FPS) of the improved model increased by 10.35% and 6.9%, respectively. The proposed model detects white and near cotton‐coloured impurities with an accuracy of up to 98.78% and 98.00%. The experimental results show that the proposed method can effectively detect and identify impurities in raw cotton, which is of great practical significance for foreign matter detection and identification in cotton.
Aisong Ma, Huan Lv, Shoujin Lin, Haihui Tan
IET Image Process.6
2019 An Evolutionary Context-aware Sequential Model for topic evolution of text stream
Haihui Tan, Wenjie Li 0002
Inf. Sci.2
2017 Neural Network based Reinforcement Learning for Real-time Pushing on Text Stream
abstract
The massive amount of noisy and redundant information in text streams makes it a challenge for users to acquire timely and relevant information in social media. Real-time notification pushing on text stream is of practical importance. In this paper, we formulate the real-time pushing on text stream as a sequential decision making problem and propose a Neural Network based Reinforcement Learning (NNRL) algorithm for real-time decision making, e.g., push or skip the incoming text, with considering both history dependencies and future uncertainty. A novel Q-Network which contains a Long Short Term Memory (LSTM) layer and three fully connected neural network layers is designed to maximize the long-term rewards. Experiment results on the real data from TREC 2016 Real-time Summarization track show that our algorithm significantly outperforms state-of-the-art methods.
Haihui Tan, Wenjie Li 0002
SIGIR1