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

Herwig Unger

dblp:09/2505 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
6since 2021 · last 2025
0000-0002-8818-3600ORCID · verified

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

Artificial intelligence and machine learning · 6 · 3 since 2021Databases, data management, data science and information retrieval · 3 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › sentiment analysis
aspect-based sentiment analysis
0.412019
Improving Aspect Term Extraction With Bidirectional Dependency Tree Representation · IEEE ACM Trans. Audio Speech Lang. Process. 2019
Natural language and speech › Information extraction and text analysis › sentiment analysis › aspect-based sentiment analysis
aspect extraction
0.412019
Improving Aspect Term Extraction With Bidirectional Dependency Tree Representation · IEEE ACM Trans. Audio Speech Lang. Process. 2019
Natural language and speech › Information extraction and text analysis › syntactic parsing
syntactic dependency representation
0.112019
Improving Aspect Term Extraction With Bidirectional Dependency Tree Representation · IEEE ACM Trans. Audio Speech Lang. Process. 2019

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

bidirectional dependency tree network · 0.4CRF · 0.4BiLSTM · 0.4
YearPublicationVenuePosition
2025 On Self-Improving Token Embeddings
Mario Kubek, Shiraj Pokharel, Thomas Böhme 0001, Emma Louise McDaniel, Herwig Unger, Armin R. Mikler
I4CS5
2025 I2QD: Unsupervised feature selection via information quality, quantity, and difference degree
Pengfei Zhang 0016, Lvhui Hu, Dexian Wang 0001, Lilan Peng, Zhong Li 0001, Herwig Unger, Tianrui Li 0001
Inf. Process. Manag.7
2024 Editorial
Wookey Lee, Herwig Unger
Data Knowl. Eng.2
2024 A learning and evolution-based intelligence algorithm for multi-objective heterogeneous cloud scheduling optimization
Yuanyuan Hao, Chunliang Zhao, Zhong Li 0001, Bingfeng Si, Herwig Unger
Knowl. Based Syst.5
2023 Guest editorial: Explainability of machine learning in methodologies and applications
Zhong Li 0001, Herwig Unger, Kyandoghere Kyamakya
Knowl. Based Syst.2
2022 Brain-Inspired Approaches to Natural Language Processing and Explainable Artificial Intelligence
Erik Deussen, Herwig Unger, Mario Kubek
I4CS2
2019 Improving Aspect Term Extraction With Bidirectional Dependency Tree Representation
abstract
Aspect term extraction is one of the important subtasks in aspect-based sentiment analysis. Previous studies have shown that using dependency tree structure representation is promising for this task. However, most dependency tree structures involve only one directional propagation on the dependency tree. In this paper, we first propose a novel bidirectional dependency tree network to extract dependency structure features from the given sentences. The key idea is to explicitly incorporate both representations gained separately from the bottom-up and top-down propagation on the given dependency syntactic tree. An end-to-end framework is then developed to integrate the embedded representations and BiLSTM plus CRF to learn both tree-structured and sequential features to solve the aspect term extraction problem. Experimental results demonstrate that the proposed model outperforms state-of-the-art baseline models on four benchmark SemEval datasets.
Huaishao Luo, Tianrui Li 0001, Bing Liu 0001, Bin Wang 0045, Herwig Unger
IEEE ACM Trans. Audio Speech Lang. Process.5
2016 Centroid Terms as Text Representatives
abstract
Algorithms to topically cluster and classify texts rely on information about their semantic distances and similarities. Standard methods based on the bag-of-words model to determine this information return only rough estimations regarding the relatedness of texts. Moreover, they are per se unable to find generalising terms or abstractions describing the textual contents. A new method to determine centroid terms in texts and to evaluate their similarity using those representing terms will be introduced. In first experiments, its results and advantages will be discussed.
Mario Kubek, Herwig Unger
DocEng2
2015 Correlating Words - Approaches and Applications
Mario Kubek, Herwig Unger, Jan Dusik
CAIP (1)2
2015 A highly accurate firefly based algorithm for heart disease prediction
Nguyen Cong Long, Phayung Meesad, Herwig Unger
Expert Syst. Appl.3
2014 Clustering Stock Data for Multi-objective portfolio Optimization
abstract
Portfolio selection is a vital research field in modern finance. Multi-objective portfolio optimization problem is the portfolio selection process that results in the highest expected return rate and the lowest identified risk among the various financial assets. This paper proposes a model that can efficiently suggest a portfolio that is worth investing. First, a cluster analysis model is introduced in order to categorize a huge amount of stock data into several groups based on their associated return rate and the risk. Several validity indexes are used to select the optimal number of clusters/stocks to be included in the portfolio. Finally, the multi-objective genetic algorithm is used to build portfolio optimization with highest return rate and lowest risk. The proposed model is tested on the data obtained from the Stock Exchange of Thailand.
Nguyen Cong Long, Nawaporn Wisitpongphan, Phayung Meesad, Herwig Unger
Int. J. Comput. Intell. Appl.4