Abstract

This article proposes a framework [Formula: see text] for evaluating entity extraction problem over cyber-physical system data. As known by us, this article is the first work focusing on this problem, which is an important step for identifying entities in cyber-physical system data. Directed by the initial entities, utilizing the relaxation and verification techniques, [Formula: see text] provides a path expression–based solution for entity extraction problem, which has following characteristics. First, using path expressions, [Formula: see text] provides a condensed presentation for entity locations whose size may get very large when scaling up the data size. Second, requiring only one entity example to indicate the interests, using relaxation technique, [Formula: see text] can discover other similar entities automatically. Third, by adjusting the example given to [Formula: see text], users can specify their own interesting entities and control the entities discovered by [Formula: see text]. Besides, utilizing the idea of sharing computations, by extending previous automaton techniques, an efficient implementation of [Formula: see text] is provided. Experimental results are reported, which show that [Formula: see text] can provide an effective and efficient solution to the entity extraction problem.

Highlights

  • There have been lots of research interests on cyberphysical system (CPS for short) since it has been widely used in real applications and produced huge influence on the way of obtaining and exchanging information of the physical world

  • (1) What is entity and entity location in P3E? (2) How does P3E represent the locations? (3) How can we find the entity locations and their attributes? After providing an overview of P3E, the formal definition of entity extraction problem is stated

  • Based on the relaxation techniques and distance F introduced above, given path expressions p for entity locations or attributes determined by user specification, P3E can discover a set of candidate entities Q, which are syntactically similar to p and possibly indicate the locations or attributes of the same kind entities interested by users

Read more

Summary

Introduction

There have been lots of research interests on cyberphysical system (CPS for short) since it has been widely used in real applications and produced huge influence on the way of obtaining and exchanging information of the physical world. Based on the relaxation techniques and distance F introduced above, given path expressions p for entity locations or attributes determined by user specification, P3E can discover a set of candidate entities Q, which are syntactically similar to p and possibly indicate the locations or attributes of the same kind entities interested by users. Given CPS data T and an initial entity expression u, the three parameters, relaxation constraint k, and (a, b) for verification measure Mq, the entity extraction problem is to return the set of entity expressions Q, such that for u0 2 Q, (1) the distance between target (u0) and target (u), F (target(u0), target(u)), is not larger than k, and (2) the measure Mq(u0, u, TD, a) is not smaller than b. All experimental results involving the time cost were obtained by running algorithms 5 times and taking the average value

Experimental results and discussions
Related work
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.