Found 3951 bookmarks
Newest
LLMs4OL: Large Language Models for Ontology Learning
LLMs4OL: Large Language Models for Ontology Learning
We propose the LLMs4OL approach, which utilizes Large Language Models (LLMs) for Ontology Learning (OL). LLMs have shown significant advancements in natural language processing, demonstrating their ability to capture complex language patterns in different knowledge domains. Our LLMs4OL paradigm investigates the following hypothesis: \textit{Can LLMs effectively apply their language pattern capturing capability to OL, which involves automatically extracting and structuring knowledge from natural language text?} To test this hypothesis, we conduct a comprehensive evaluation using the zero-shot prompting method. We evaluate nine different LLM model families for three main OL tasks: term typing, taxonomy discovery, and extraction of non-taxonomic relations. Additionally, the evaluations encompass diverse genres of ontological knowledge, including lexicosemantic knowledge in WordNet, geographical knowledge in GeoNames, and medical knowledge in UMLS.
·arxiv.org·
LLMs4OL: Large Language Models for Ontology Learning
There is a lot of research on establishing mappings between different ontologies, but hardly any work on how to leverage such mappings in a query federation engine
There is a lot of research on establishing mappings between different ontologies, but hardly any work on how to leverage such mappings in a query federation engine
“There is a lot of research on establishing mappings between different ontologies, but hardly any work on how to leverage such mappings in a query federation engine. With @Sijin_Cheng and @ferradest, we have embarked on changing that. Paper at @CoopIS2023 https://t.co/vF1emf9R6Z”
·twitter.com·
There is a lot of research on establishing mappings between different ontologies, but hardly any work on how to leverage such mappings in a query federation engine
Gartner's Hype Cycle 2023
Gartner's Hype Cycle 2023
Ah, Gartner's Hype Cycle. It's always fun to see what's on the roller coaster. I think the position of Knowledge Graphs is about right - the KM community is… | 10 comments on LinkedIn
·linkedin.com·
Gartner's Hype Cycle 2023
Why Establishing Data Context is the Key to Creating Competitive Advantage - SD Times
Why Establishing Data Context is the Key to Creating Competitive Advantage - SD Times
The age of Big Data inevitably brought computationally intensive problems to the enterprise. Central to today’s efficient business operations are the activities of data capturing and storage, search, sharing, and data analytics.
·sdtimes.com·
Why Establishing Data Context is the Key to Creating Competitive Advantage - SD Times
Graph Database Market Share, Analysis | Global Report, 2030
Graph Database Market Share, Analysis | Global Report, 2030
Graph Database Market is anticipated to reach USD XX.X MN by 2030, this market report provides the growth, trends, key players & forecast of the market based on in-depth research by industry experts. The global market size, share along with drivers and restraints are covered in the graph database market report
·valuemarketresearch.com·
Graph Database Market Share, Analysis | Global Report, 2030
Human-centered data networking with interpersonal knowledge graphs - DataScienceCentral.com
Human-centered data networking with interpersonal knowledge graphs - DataScienceCentral.com
In the case of interpersonal knowledge graphs, everyone in the community can contribute to the disambiguation and enrichment of the community’s online presence, and at the same time help with findability, accessibility, interoperability and reuse (the FAIR principles). And that applies not only to someone else finding your path to research discovery, but you being able to retrace your own steps whenever you need to.
·datasciencecentral.com·
Human-centered data networking with interpersonal knowledge graphs - DataScienceCentral.com
Finding Money Launderers Using Heterogeneous Graph Neural Networks
Finding Money Launderers Using Heterogeneous Graph Neural Networks
Current anti-money laundering (AML) systems, predominantly rule-based, exhibit notable shortcomings in efficiently and precisely detecting instances of money laundering. As a result, there has been a recent surge toward exploring alternative approaches, particularly those utilizing machine learning. Since criminals often collaborate in their money laundering endeavors, accounting for diverse types of customer relations and links becomes crucial. In line with this, the present paper introduces a graph neural network (GNN) approach to identify money laundering activities within a large heterogeneous network constructed from real-world bank transactions and business role data belonging to DNB, Norway's largest bank. Specifically, we extend the homogeneous GNN method known as the Message Passing Neural Network (MPNN) to operate effectively on a heterogeneous graph. As part of this procedure, we propose a novel method for aggregating messages across different edges of the graph. Our findings highlight the importance of using an appropriate GNN architecture when combining information in heterogeneous graphs. The performance results of our model demonstrate great potential in enhancing the quality of electronic surveillance systems employed by banks to detect instances of money laundering. To the best of our knowledge, this is the first published work applying GNN on a large real-world heterogeneous network for anti-money laundering purposes.
·arxiv.org·
Finding Money Launderers Using Heterogeneous Graph Neural Networks
RedisGraph End-of-Life Announcement
RedisGraph End-of-Life Announcement
Redis Inc. is phasing out RedisGraph. This blog post explains the motivation behind this decision and the implications for existing customers and community members.
·redis.com·
RedisGraph End-of-Life Announcement
Hierarchical Navigable Small World (HNSW) is one of the most efficient ways to build indexes for vector databases. The idea is to build a similarity graph and traverse that graph to find the nodes that are the closest to a query vector
Hierarchical Navigable Small World (HNSW) is one of the most efficient ways to build indexes for vector databases. The idea is to build a similarity graph and traverse that graph to find the nodes that are the closest to a query vector
We have seen recently a surge in vector databases in this era of generative AI. The idea behind vector databases is to index the data with vectors that relate… | 30 comments on LinkedIn
·linkedin.com·
Hierarchical Navigable Small World (HNSW) is one of the most efficient ways to build indexes for vector databases. The idea is to build a similarity graph and traverse that graph to find the nodes that are the closest to a query vector
OpenFact: Factuality Enhanced Open Knowledge Extraction | Transactions of the Association for Computational Linguistics | MIT Press
OpenFact: Factuality Enhanced Open Knowledge Extraction | Transactions of the Association for Computational Linguistics | MIT Press
Abstract. We focus on the factuality property during the extraction of an OpenIE corpus named OpenFact, which contains more than 12 million high-quality knowledge triplets. We break down the factuality property into two important aspects—expressiveness and groundedness—and we propose a comprehensive framework to handle both aspects. To enhance expressiveness, we formulate each knowledge piece in OpenFact based on a semantic frame. We also design templates, extra constraints, and adopt human efforts so that most OpenFact triplets contain enough details. For groundedness, we require the main arguments of each triplet to contain linked Wikidata1 entities. A human evaluation suggests that the OpenFact triplets are much more accurate and contain denser information compared to OPIEC-Linked (Gashteovski et al., 2019), one recent high-quality OpenIE corpus grounded to Wikidata. Further experiments on knowledge base completion and knowledge base question answering show the effectiveness of OpenFact over OPIEC-Linked as supplementary knowledge to Wikidata as the major KG.
·direct.mit.edu·
OpenFact: Factuality Enhanced Open Knowledge Extraction | Transactions of the Association for Computational Linguistics | MIT Press
NebulaGraph v3.5.0 Release Note
NebulaGraph v3.5.0 Release Note
NebulaGraph v3.5.0 is released, which supports full table scan without index and greatly improves FIND PATH performance.
·nebula-graph.io·
NebulaGraph v3.5.0 Release Note
More Graph DBs in @LangChainAI
More Graph DBs in @LangChainAI
“📈 More Graph DBs in @LangChainAI Graphs can store structured information in a way embeddings can't capture, and we're excited to support even more of them in LangChain: HugeGraph and SPARQL Not only can you query data, but you can also update graph data (!!!) 🧵”
More Graph DBs in @LangChainAI
·twitter.com·
More Graph DBs in @LangChainAI
Knowledge graphs are graph-structured collections of facts. And facts are statements that define and describe subject entities in terms of predicates and their values
Knowledge graphs are graph-structured collections of facts. And facts are statements that define and describe subject entities in terms of predicates and their values
Knowledge graphs are graph-structured collections of facts. And facts are statements that define and describe subject entities in terms of predicates and their…
Knowledge graphs are graph-structured collections of facts. And facts are statements that define and describe subject entities in terms of predicates and their values
·linkedin.com·
Knowledge graphs are graph-structured collections of facts. And facts are statements that define and describe subject entities in terms of predicates and their values
Neosemantics (n10s) reaches the first million all-time downloads
Neosemantics (n10s) reaches the first million all-time downloads
📢 📢 📢 Amazing milestone! 📢 📢 📢 Neosemantics (n10s) reaches the first million all-time downloads 🤯 Let's keep building Knowledge Graphs together! 💪… | 21 comments on LinkedIn
Neosemantics (n10s) reaches the first million all-time downloads
·linkedin.com·
Neosemantics (n10s) reaches the first million all-time downloads
ArtGraph cluster analysis
ArtGraph cluster analysis
This blog post describes how to get semi-automatically interesting insights of an arts knowledge graph using Knime and Neo4j.
·medium.com·
ArtGraph cluster analysis
**Improved** — the BFO Classifier
**Improved** — the BFO Classifier
brief description of our FOIS2023 paper entitled “a method to improve alignments between domain and foundational ontologies”, focusing on BFO-aligned ontologies
·keet.wordpress.com·
**Improved** — the BFO Classifier