000866091 000__ 03638cam\a2200505Ii\4500
000866091 001__ 866091
000866091 005__ 20230306145810.0
000866091 006__ m\\\\\o\\d\\\\\\\\
000866091 007__ cr\cn\nnnunnun
000866091 008__ 190313s2019\\\\sz\\\\\\ob\\\\001\0\eng\d
000866091 019__ $$a1089850563$$a1089954600$$a1090037938$$a1091322483
000866091 020__ $$a9783030123758$$q(electronic book)
000866091 020__ $$a3030123758$$q(electronic book)
000866091 020__ $$z9783030123741
000866091 020__ $$z303012374X
000866091 0247_ $$a10.1007/978-3-030-12375-8$$2doi
000866091 035__ $$aSP(OCoLC)on1089791950
000866091 035__ $$aSP(OCoLC)1089791950$$z(OCoLC)1089850563$$z(OCoLC)1089954600$$z(OCoLC)1090037938$$z(OCoLC)1091322483
000866091 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dEBLCP$$dYDX$$dDKU$$dUKMGB$$dUPM
000866091 049__ $$aISEA
000866091 050_4 $$aQA76.76.E95
000866091 08204 $$a006.3/3$$223
000866091 1001_ $$aKejriwal, Mayank.$$eauthor.
000866091 24510 $$aDomain-specific knowledge graph construction /$$cMayank Kejriwal.
000866091 264_1 $$aCham, Switzerland :$$bSpringer,$$c2019.
000866091 300__ $$a1 online resource (xiv, 107 pages) :$$billustrations.
000866091 336__ $$atext$$btxt$$2rdacontent
000866091 337__ $$acomputer$$bc$$2rdamedia
000866091 338__ $$aonline resource$$bcr$$2rdacarrier
000866091 347__ $$atext file$$bPDF$$2rda
000866091 4901_ $$aSpringerBriefs in computer science,$$x2191-5768
000866091 504__ $$aIncludes bibliographical references and index.
000866091 5050_ $$aIntro; Preface; Acknowledgments; Contents; Acronyms; 1 What Is a Knowledge Graph?; 1.1 Introduction; 1.2 Example 1: Academic Domain; 1.3 Example 2: Products and Companies; 1.4 Example 3: Geopolitical Events; 1.5 Conclusion; 2 Information Extraction; 2.1 Introduction; 2.2 Challenges of IE; 2.3 Scope of IE Tasks; 2.3.1 Named Entity Recognition; 2.3.1.1 Supervised Methods; 2.3.1.2 Semi-supervised Methods; 2.3.1.3 Unsupervised Methods; 2.3.1.4 Features; 2.3.2 Relation Extraction; 2.3.3 Event Extraction; 2.3.4 Web IE; 2.4 Evaluating IE Performance; 2.5 Summary; 3 Entity Resolution
000866091 5058_ $$a3.1 Introduction3.2 Challenges and Requirements; 3.3 Two-Step Framework; 3.3.1 Blocking; 3.3.1.1 Traditional Blocking; 3.3.1.2 Sorted Neighborhood; 3.3.1.3 Canopies; 3.3.1.4 Research Frontier: Learning Blocking Keys; 3.3.2 Similarity; 3.4 Measuring Performance; 3.4.1 Measuring Blocking Performance; 3.4.2 Measuring Similarity Performance; 3.5 Extending the Two-Step Workflow: A Brief Note; 3.6 Related Work: A Brief Review; 3.6.1 Automated ER Solutions; 3.6.1.1 The Automation-Scalability Tradeoff; 3.6.2 Structural Heterogeneity; 3.6.3 Blocking Without Supervision: Where Do We Stand?; 3.7 Summary
000866091 5058_ $$a4 Advanced Topic: Knowledge Graph Completion4.1 Introduction; 4.2 Knowledge Graph Embeddings; 4.2.1 TransE; 4.2.2 TransE Extensions and Alternatives; 4.2.3 Limitations and Alternatives; 4.2.4 Research Frontiers and Recent Work; 4.2.4.1 Ontological Information; 4.2.4.2 Text; 4.2.4.3 Other Extrinsic Information Sets; 4.2.5 Applications of KGEs; 4.3 Summary; 5 Ecosystems; 5.1 Introduction; 5.2 Web of Linked Data; 5.2.1 Linked Data Principles; 5.2.2 Technology Stack; 5.2.3 Linking Open Data; 5.2.4 Example: DBpedia; 5.3 Google Knowledge Vault; 5.4 Schema.org; 5.5 Where is the Future Going?
000866091 506__ $$aAccess limited to authorized users.
000866091 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed March 13, 2019).
000866091 650_0 $$aExpert systems (Computer science)
000866091 650_0 $$aGraph databases.
000866091 77608 $$iPrint version: :$$z9783030123741
000866091 830_0 $$aSpringerBriefs in computer science.
000866091 852__ $$bebk
000866091 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-12375-8$$zOnline Access$$91397441.1
000866091 909CO $$ooai:library.usi.edu:866091$$pGLOBAL_SET
000866091 980__ $$aEBOOK
000866091 980__ $$aBIB
000866091 982__ $$aEbook
000866091 983__ $$aOnline
000866091 994__ $$a92$$bISE