Domain-oriented Entity Set Extension Based on Bipartite Graph

DOI

10.2991/icmmct-18.2018.54How to use a DOI?

Keywords

Web Data; Data extraction; Data Mining.

Abstract

This paper mainly studies the problem of entity set extension in domain data. On the basis of bipartite graph methods, given an improved algorithm which consider the general case that the edges of the graph have different weights. The designed algorithm can dynamically adjusts the the size of the entity extension sets in the given number of initial iterations, and when the number of iterations exceeds the threshold, the size of the entity extension sets remains unchanged, which can reflect the actual situation more accurately. Finally, the effectiveness of the algorithm is verified by experiments.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Liming Du
AU  - Abdulhamid Yahaya
AU  - Gui Li
AU  - Fengying Wang
AU  - Jie Dong
PY  - 2018/06
DA  - 2018/06
TI  - Domain-oriented Entity Set Extension Based on Bipartite Graph
BT  - Proceedings of the 2018 6th International Conference on Machinery, Materials and Computing Technology (ICMMCT 2018)
PB  - Atlantis Press
SP  - 269
EP  - 274
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmmct-18.2018.54
DO  - 10.2991/icmmct-18.2018.54
ID  - Du2018/06
ER  -