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

Amir Nafi

dblp:286/7134 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0001-9836-511XORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 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.

Artificial intelligence
1 paper
Information extraction and text analysis · 67% Generative modeling · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
generative adversarial network
0.512021
PaGAN: Generative Adversarial Network for Patent understanding · ICDM 2021
Natural language and speech › Information extraction and text analysis › text classification
semi-supervised text classification
0.512021
PaGAN: Generative Adversarial Network for Patent understanding · ICDM 2021

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

sentence-level classifier · 0.5document classifier · 0.5GAN · 0.5
YearPublicationVenuePosition
2021 PaGAN: Generative Adversarial Network for Patent understanding
abstract
In recent years, Deep Learning methods have become very popular in Natural Language Processing (NLP), especially transformer-based architecture. NLP domain requires a high volume of annotated data to work. Unfortunately, obtaining high-quality and voluminous labeled data is expensive and time-consuming. One promising method which has singled out for its performance in the context of data deficiency is semi-supervised learning with Generative Adversarial Networks (GAN). In this paper, we propose a new approach called PaGAN which is a combination of a document classifier and a sentence-level classifier inside a GAN for patent documents understanding. The idea is to mine the patent’s motivating problem (aka contradiction in TRIZ domain) which is fundamentally important to understand the underlying invention and its originality. PaGAN is applied and evaluated on a real-world dataset. Experiments show outperforming results of PaGAN comparatively to baseline approaches.
Guillaume Guarino, Ahmed Samet, Amir Nafi, Denis Cavallucci
ICDM3
2020 SummaTRIZ : Summarization Networks for Mining Patent Contradiction
abstract
TRIZ theory is considered as a kind of innovative theory, which mainly functions in solving contradiction and aims to improve engineers creativity. It may reason on different support such as web and scientific documents. Most of the current knowledge, especially in industrial domains lies in patents. They are, nevertheless, an underused resource because of their complexity, their length and the need of domain knowledge to make use of patent. In this paper, we introduce an innovative application of deep learning to mine knowledge from patents. We show that our summarization based approach, called SummaTRIZ1, enables the extraction of these contradictions essential for TRIZ problem solving engine. A BERT based summarization approach is introduced to retain contradiction sentences. Our approach is experimentally evaluated on a real data set showing the performance of SummaTRIZ.
Guillaume Guarino, Ahmed Samet, Amir Nafi, Denis Cavallucci
ICMLA3