图书简介
The vast amounts of ontologically unstructured information on the Web, including HTML, XML and JSON documents, natural language documents, tweets, blogs, markups, and even structured documents like CSV tables, all contain useful knowledge that can present a tremendous advantage to the Artificial Intelligence community if extracted robustly, efficiently and semi-automatically as knowledge graphs. Domain-specific Knowledge Graph Construction (KGC) is an active research area that has recently witnessed impressive advances due to machine learning techniques like deep neural networks and word embeddings. This book will synthesize Knowledge Graph Construction over Web Data in an engaging and accessible manner. The book will describe a timely topic for both early -and mid-career researchers. Every year, more papers continue to be published on knowledge graph construction, especially for difficult Web domains. This work would serve as a useful reference, as well as an accessible but rigorous overview of this body of work. The book will present interdisciplinary connections when possible to engage researchers looking for new ideas or synergies. This will allow the book to be marketed in multiple venues and conferences. The book will also appeal to practitioners in industry and data scientists since it will have chapters on both data collection, as well as a chapter on querying and off-the-shelf implementations. The author has, and continues to, present on this topic at large and important conferences. He plans to make the powerpoint he presents available as a supplement to the work. This will draw a natural audience for the book. Some of the reviewers are unsure about his position in the community but that seems to be more a function of his age rather than his relative expertise. I agree with some of the reviewers that the title is a little complicated. I would recommend “Domain Specific Knowledge Graphs”.
1 What is a knowledge graph?. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.2 Example 1: Academic Domain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41.3 Example 2: Products and Companies . . . . . . . . . . . . . . . . . . . . . . . . . . 51.4 Example 3: Geopolitical Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61.5 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.-2 Information Extraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92.2 Challenges of IE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102.3 Scope of IE Tasks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112.3.1 Named Entity Recognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122.3.2 Relation Extraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 212.3.3 Event Extraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242.3.4 Web IE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 262.4 Evaluating IE Performance. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30.-3 Entity Resolution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 313.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 313.2 Challenges and Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323.3 Two-step Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363.3.1 Blocking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 373.3.2 Similarity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423.4 Measuring Performance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453.4.1 Measuring Blocking Performance . . . . . . . . . . . . . . . . . . . . . . 463.4.2 Measuring Similarity Performance . . . . . . . . . . . . . . . . . . . . . . 483.5 Extending the Two-Step Workflow: A Brief Note . . . . . . . . . . . . . . . . 483.6 Related Work: A Brief Review . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 493.6.1 Automated ER Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 493.6.2 Structural Heterogeneity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533.6.3 Blocking Without Supervision: Where Do We Stand? . . . . . . 543.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54.-4 Advanced Topic: Knowledge Graph Completion . . . . . . . . . . . . . . . . . . . 554.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554.2 Knowledge Graph Embeddings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 574.2.1 TransE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 594.2.2 TransE Extensions and Alternatives . . . . . . . . . . . . . . . . . . . . . 604.2.3 Limitations and Alternatives . . . . . . . . . . . . . . . . . . . . . . . . . . . 624.2.4 Research Frontiers and Recent Work . . . . . . . . . . . . . . . . . . . . 624.2.5 Applications of KGEs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 684.3 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70.-5 Ecosystems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 715.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 715.2 Web of Linked Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 715.2.1 Linked Data Principles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 735.2.2 Technology Stack . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 745.2.3 Linking Open Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 755.2.4 Example: DBpedia . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 765.3 Google Knowledge Vault . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 785.4 Schema.org . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 795.5 Where is the future going? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82.-References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84.-Glossary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93.-Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97.
Trade Policy 买家须知
- 关于产品:
- ● 正版保障:本网站隶属于中国国际图书贸易集团公司,确保所有图书都是100%正版。
- ● 环保纸张:进口图书大多使用的都是环保轻型张,颜色偏黄,重量比较轻。
- ● 毛边版:即书翻页的地方,故意做成了参差不齐的样子,一般为精装版,更具收藏价值。
关于退换货:
- 由于预订产品的特殊性,采购订单正式发订后,买方不得无故取消全部或部分产品的订购。
- 由于进口图书的特殊性,发生以下情况的,请直接拒收货物,由快递返回:
- ● 外包装破损/发错货/少发货/图书外观破损/图书配件不全(例如:光盘等)
并请在工作日通过电话400-008-1110联系我们。
- 签收后,如发生以下情况,请在签收后的5个工作日内联系客服办理退换货:
- ● 缺页/错页/错印/脱线
关于发货时间:
- 一般情况下:
- ●【现货】 下单后48小时内由北京(库房)发出快递。
- ●【预订】【预售】下单后国外发货,到货时间预计5-8周左右,店铺默认中通快递,如需顺丰快递邮费到付。
- ● 需要开具发票的客户,发货时间可能在上述基础上再延后1-2个工作日(紧急发票需求,请联系010-68433105/3213);
- ● 如遇其他特殊原因,对发货时间有影响的,我们会第一时间在网站公告,敬请留意。
关于到货时间:
- 由于进口图书入境入库后,都是委托第三方快递发货,所以我们只能保证在规定时间内发出,但无法为您保证确切的到货时间。
- ● 主要城市一般2-4天
- ● 偏远地区一般4-7天
关于接听咨询电话的时间:
- 010-68433105/3213正常接听咨询电话的时间为:周一至周五上午8:30~下午5:00,周六、日及法定节假日休息,将无法接听来电,敬请谅解。
- 其它时间您也可以通过邮件联系我们:customer@readgo.cn,工作日会优先处理。
关于快递:
- ● 已付款订单:主要由中通、宅急送负责派送,订单进度查询请拨打010-68433105/3213。
本书暂无推荐
本书暂无推荐