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

Yanhong Zhai

dblp:82/4590 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2006
—ORCID · none

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

Databases, data management, data science and information retrieval · 5 · 3 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
3 papers
Information extraction and text analysis · 83% Knowledge representation and reasoning · 17%
Databases, data mining, and information retrieval
2 papers
Data integration and cleaning · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
web information extraction
0.232006
Structured Data Extraction from the Web Based on Partial Tree Alignment · IEEE Trans. Knowl. Data Eng. 2006
Automatic Wrapper Generation Using Tree Matching and Partial Tree Alignment · AAAI 2006
Mining data records in Web pages · KDD 2003
Natural language and speech › Information extraction and text analysis
pattern discovery
0.112006
Structured Data Extraction from the Web Based on Partial Tree Alignment · IEEE Trans. Knowl. Data Eng. 2006
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
structured information extraction
0.112006
Structured Data Extraction from the Web Based on Partial Tree Alignment · IEEE Trans. Knowl. Data Eng. 2006
Natural language and speech › Information extraction and text analysis › web information extraction
wrapper induction
0.112006
Automatic Wrapper Generation Using Tree Matching and Partial Tree Alignment · AAAI 2006
Data integration and cleaning › data extraction
web data extraction
0.112005
Web data extraction based on partial tree alignment · WWW 2005
Data integration and cleaning › data extraction
structured data extraction
0.012003
Mining data records in Web pages · KDD 2003

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

partial tree alignment · 0.2tree matching · 0.1string matching · 0.1visual information segmentation · 0.1
YearPublicationVenuePosition
2006 Automatic Wrapper Generation Using Tree Matching and Partial Tree Alignment
Yanhong Zhai, Bing Liu 0001
AAAI1
2006 Structured Data Extraction from the Web Based on Partial Tree Alignment
abstract
This paper studies the problem of structured data extraction from arbitrary Web pages. The objective of the proposed research is to automatically segment data records in a page, extract data items/fields from these records, and store the extracted data in a database. Existing methods addressing the problem can be classified into three categories. Methods in the first category provide some languages to facilitate the construction of data extraction systems. Methods in the second category use machine learning techniques to learn wrappers (which are data extraction programs) from human labeled examples. Manual labeling is time-consuming and is hard to scale to a large number of sites on the Web. Methods in the third category are based on the idea of automatic pattern discovery. However, multiple pages that conform to a common schema are usually needed as the input. In this paper, we propose a novel and effective technique (called DEPTA) to perform the task of Web data extraction automatically. The method consists of two steps: 1) identifying individual records in a page and 2) aligning and extracting data items from the identified records. For step 1, a method based on visual information and tree matching is used to segment data records. For step 2, a novel partial alignment technique is proposed. This method aligns only those data items in a pair of records that can be aligned with certainty, making no commitment on the rest of the items. Experimental results obtained using a large number of Web pages from diverse domains show that the proposed two-step technique is highly effective.
Yanhong Zhai, Bing Liu 0001
IEEE Trans. Knowl. Data Eng.1
2005 NET - A System for Extracting Web Data from Flat and Nested Data Records
Bing Liu 0001, Yanhong Zhai
WISE2
2005 Extracting Web Data Using Instance-Based Learning
Yanhong Zhai, Bing Liu 0001
WISE1
2005 Web data extraction based on partial tree alignment
abstract
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items/fields from them and put the data in a database table. This problem has been studied by several researchers. However, existing methods still have some serious limitations. The first class of methods is based on machine learning, which requires human labeling of many examples from each Web site that one is interested in extracting data from. The process is time consuming due to the large number of sites and pages on the Web. The second class of algorithms is based on automatic pattern discovery. These methods are either inaccurate or make many assumptions. This paper proposes a new method to perform the task automatically. It consists of two steps, (1) identifying individual data records in a page, and (2) aligning and extracting data items from the identified data records. For step 1, we propose a method based on visual information to segment data records, which is more accurate than existing methods. For step 2, we propose a novel partial alignment technique based on tree matching. Partial alignment means that we align only those data fields in a pair of data records that can be aligned (or matched) with certainty, and make no commitment on the rest of the data fields. This approach enables very accurate alignment of multiple data records. Experimental results using a large number of Web pages from diverse domains show that the proposed two-step technique is able to segment data records, align and extract data from them very accurately.
Yanhong Zhai, Bing Liu 0001
WWW1
2003 Mining data records in Web pages
abstract
A large amount of information on the Web is contained in regularly structured objects, which we call data records. Such data records are important because they often present the essential information of their host pages, e.g., lists of products or services. It is useful to mine such data records in order to extract information from them to provide value-added services. Existing automatic techniques are not satisfactory because of their poor accuracies. In this paper, we propose a more effective technique to perform the task. The technique is based on two observations about data records on the Web and a string matching algorithm. The proposed technique is able to mine both contiguous and non-contiguous data records. Our experimental results show that the proposed technique outperforms existing techniques substantially.
Bing Liu 0001, Robert L. Grossman, Yanhong Zhai
KDD3