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

Amirhossein Akbarnejad

dblp:182/2501 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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
Data mining · 93% Machine learning and data management · 7%

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

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling
classification
0.412019
An Efficient Semi-Supervised Multi-label Classifier Capable of Handling Missing Labels · IEEE Trans. Knowl. Data Eng. 2019
Data mining › representation learning
label embedding
0.412019
An Efficient Semi-Supervised Multi-label Classifier Capable of Handling Missing Labels · IEEE Trans. Knowl. Data Eng. 2019
Data mining › predictive modeling › classification
multi-label classification
0.412019
An Efficient Semi-Supervised Multi-label Classifier Capable of Handling Missing Labels · IEEE Trans. Knowl. Data Eng. 2019
Data mining › predictive modeling › classification › multi-label classification
semi-supervised multi-label learning
0.412019
An Efficient Semi-Supervised Multi-label Classifier Capable of Handling Missing Labels · IEEE Trans. Knowl. Data Eng. 2019

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

stochastic embedding · 0.4dimensionality reduction · 0.4
YearPublicationVenuePosition
2019 An Efficient Semi-Supervised Multi-label Classifier Capable of Handling Missing Labels
abstract
Multi-label classification has received considerable interest in recent years. Multi-label classifiers usually need to address many issues including: handling large-scale datasets with many instances and a large set of labels, compensating missing label assignments in the training set, considering correlations between labels, as well as exploiting unlabeled data to improve prediction performance. To tackle datasets with a large set of labels, embedding-based methods represent the label assignments in a low-dimensional space. Many state-of-the-art embedding-based methods use a linear dimensionality reduction to map the label assignments to a low-dimensional space. However, by doing so, these methods actually neglect the tail labels - labels that are infrequently assigned to instances. In this paper, we propose an embedding-based method that non-linearly embeds the label vectors using a stochastic approach, thereby predicting the tail labels more accurately. Moreover, the proposed method has excellent mechanisms for handling missing labels, dealing with large-scale datasets, as well as exploiting unlabeled data. Experiments on real-world datasets show that our method outperforms state-of-the-art multi-label classifiers by a large margin, in terms of prediction performance, as well as training time. Our implementation of the proposed method is available online at:https://github.com/Akbarnejad/ESMC_ Implementation.
Amirhossein Akbarnejad, Mahdieh Soleymani Baghshah
IEEE Trans. Knowl. Data Eng.1
2017 A probabilistic multi-label classifier with missing and noisy labels handling capability
Amirhossein Akbarnejad, Mahdieh Soleymani Baghshah
Pattern Recognit. Lett.1