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

Lasguido Nio

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

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › relation extraction
attribute value extraction
0.412019
Accurate Product Attribute Extraction on the Field · ICDE 2019
Natural language and speech › Information extraction and text analysis › bootstrapping
bootstrapping for information extraction
0.412019
Accurate Product Attribute Extraction on the Field · ICDE 2019

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

ensemble learning · 0.4bootstrapping · 0.4
YearPublicationVenuePosition
2019 Accurate Product Attribute Extraction on the Field
abstract
In this paper we present a bootstrapping approach for attribute value extraction that minimizes the need for human intervention. Our approach automatically extracts attribute names and values from semi-structured text, generates a small labelled dataset, and bootstraps it by extracting new values from unstructured text. It is domain/language-independent, relying only on existing semi-structured text to create the initial labeled dataset. We assess the impact of different machine learning approaches to increase precision of the core approach without compromising coverage. We perform an extensive evaluation using e-commerce product data across different categories in two languages and hundreds of thousands of product pages. We show that our approach provides high precision and good coverage. In addition, we study the impact of different methods that address specific sources of error. With error analysis we highlight how these methods complement each other, obtaining insights about the individual methods and the ensamble as a whole.
Martín Rezk, Laura Alonso Alemany, Lasguido Nio, Ted Zhang
ICDE3
2018 Intelligence Is Asking The Right Question: A Study On Japanese Question Generation
abstract
Traditional automatic question generation often requires hand-crafted templates or sophisticated NLP pipelines. Such approaches, however, require extensive labor and expertise to morphologically analyze the sentences and create the NLP framework. Our works aim to simplify these labors. We conduct a contrastive experiment between two types of sequence learning: statistical-based machine translation and attention-based sequence neural network. These models can be trained end-to-end, and it can capture the pattern between the input sequence and output sequence, thus diminishing the need to prepare a sophisticated NLP pipeline. Automatic evaluation results show that our system outperforms the state-of-the-art rule-based system, and also excels in terms of content quality and fluency according to a subjective human test.
Lasguido Nio, Koji Murakami
SLT1
2014 Improving the robustness of example-based dialog retrieval using recursive neural network paraphrase identification
abstract
Previous work on example-based chat-oriented dialog systems utilizing real human-to-human conversation has shown promising results. However, most previous methods use relatively simple retrieval techniques, resulting in weakness to out of vocabulary (OOV) database queries and inadequate handling of interactions between words in the sentence. To overcome this problem, in this paper we propose a method to utilize recursive neural network paraphrase identification to improve the accuracy and robustness of example-based dialog response retrieval. We model our dialog-pair database and user input query with distributed word representations, and employ recursive autoencoders and dynamic pooling to determine whether two sentences with arbitrary length have the same meaning. The distributed representations have the potential to improve handling of OOV cases, and the recursive structure can reduce confusion in example matching. We evaluate the system performance based on objective and subjective metrics.
Lasguido Nio, Sakriani Sakti, Graham Neubig, Tomoki Toda, Satoshi Nakamura 0001
SLT1