文章背景与核心概要
本文介绍了 SSAKG 2.0,这是一个用于构建和操作结构化顺序关联知识图谱(Structural Sequential Associative Knowledge Graphs, SSAKGs)的开源软件库。随着人工智能对高效、联想式记忆检索的需求日益增长,传统的向量数据库或图数据库在处理基于局部的、无序上下文进行完整序列重建时往往面临挑战。SSAKG 2.0 创新性地将对象表示为图的顶点,将有序序列表示为稀疏图中的结构连接模式,从而充当强大的关联记忆系统。
在技术实现上,该软件包采用 Python 与 C 语言的混合架构:利用 Python 提供灵活的高级编程接口,同时将性能关键的图操作用 C 语言实现,以突破大规模稀疏图的计算和内存瓶颈。版本 2.0 引入了全新的位级(bit-level)内存优化算法,能够高效搜索图连接。研究团队通过随机生成的数值序列、NLTK 语料库中的自然语言句子以及 mRNA 序列对该算法进行了全面评估,验证了其在部分上下文检索、图密度、序列长度和内存容量等维度的卓越性能。该软件已在 GitHub 和 PyPI 开源发布,采用 Apache 2.0 许可证。
SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval
arXiv: 2609.01849 [cs.AI]
Submitted: September 1, 2026
Authors: Przemysław Stokłosa, Janusz A. Starzyk, Paweł Raif
License: Apache 2.0
📌 Summary
SSAKG 2.0 is an open-source software package designed for constructing and operating Structural Sequential Associative Knowledge Graphs (SSAKGs).
- Core Concept: Represents objects as graph vertices and ordered sequences as structural connection patterns within a sparse graph, functioning as an associative memory capable of reconstructing complete sequences from partial, unordered contexts.
- Architecture & Performance: Implemented primarily in Python with performance-critical graph operations written in C. Version 2.0 introduces bit-level memory optimization algorithms to search graph connections efficiently, reducing memory and computational overhead for large sparse graphs.
- Evaluation: Tested across randomly generated numerical sequences, natural language sentences from the NLTK corpus, and mRNA sequences to evaluate how graph density, sequence length, and memory size impact retrieval performance.
- Availability: Distributed via GitHub and the Python Package Index (PyPI) with full documentation and reproducible examples.
SSAKG 2.0 是一个开源软件包,旨在构建和操作结构化顺序关联知识图谱(SSAKGs)。
- 核心概念: 将对象表示为图的顶点,将有序序列表示为稀疏图中的结构连接模式,作为关联记忆运作,能够从局部的、无序的上下文中重建完整序列。
- 架构与性能: 主要使用 Python 实现,性能关键的图操作则用 C 语言编写。版本 2.0 引入了位级内存优化算法以高效搜索图连接,减少了大型稀疏图的内存和计算开销。
- 评估: 在随机生成的数值序列、NLTK 语料库中的自然语言句子以及 mRNA 序列上进行了测试,以评估图密度、序列长度和内存大小对检索性能的影响。
- 可用性: 通过 GitHub 和 Python 包索引(PyPI)分发,提供完整的文档和可复现的示例。
🔗 Quick Links & Resources
- Full-Text: View PDF | HTML (Experimental) | TeX Source
- External Citations & Tools:
- Google Scholar
- Semantic Scholar
- NASA ADS
- Social & Bookmarking: BibSonomy | Reddit
- 全文链接: 查看 PDF | HTML(实验性) | TeX 源码
- 外部引用与工具:
- Google Scholar
- Semantic Scholar
- NASA ADS
- 社交与书签: BibSonomy | Reddit
📑 Abstract
This article presents SSAKG 2.0, an open-source software package for constructing and operating Structural Sequential Associative Knowledge Graphs (SSAKGs). An SSAKG represents objects as graph vertices and ordered sequences as structural patterns of graph connections. The resulting sparse graph is used as an associative memory in which complete sequences can be reconstructed from a partial, unordered context.
Version 2.0 introduces new algorithms that exploit individual bits of computer memory to efficiently search graph connections. The package is implemented in Python, while performance-critical graph operations are implemented in C and exposed through a Python interface. This hybrid implementation provides a flexible high-level programming environment while reducing the memory and computational overhead associated with large sparse graphs.
The algorithms were evaluated using randomly generated numerical sequences, sequences derived from sentences in the NLTK corpus, and mRNA sequences. The experiments demonstrate the ability of the package to store and reconstruct sequences from partial contexts and provide a basis for evaluating the effects of graph density, sequence length, and memory size on retrieval performance.
SSAKG 2.0 is distributed under the Apache 2.0 open-source license. The package includes documentation and reproducible examples and is publicly available through GitHub and the Python Package Index (PyPI).
本文介绍了 SSAKG 2.0,这是一个用于构建和操作结构化顺序关联知识图谱(SSAKGs)的开源软件包。SSAKG 将对象表示为图顶点,将有序序列表示为图连接的结构模式。由此产生的稀疏图被用作关联记忆,其中可以从局部的、无序的上下文中重建完整的序列。
版本 2.0 引入了新算法,利用计算机内存的各个位来高效搜索图连接。该软件包使用 Python 实现,而性能关键的图操作则使用 C 语言实现,并通过 Python 接口暴露出来。这种混合实现提供了一个灵活的高级编程环境,同时减少了与大型稀疏图相关的内存和计算开销。
该算法通过随机生成的数值序列、源自 NLTK 语料库句子的序列以及 mRNA 序列进行了评估。实验证明了该软件包存储和从局部上下文重建序列的能力,并为评估图密度、序列长度和内存大小对检索性能的影响提供了基础。
SSAKG 2.0 遵循 Apache 2.0 开源许可证发布。该软件包包含文档和可复现的示例,可通过 GitHub 和 Python 包索引(PyPI)公开获取。
📊 Article Metadata
| Property | Details |
|---|---|
| Comments | 15 pages, 5 figures |
| Primary Subject | Artificial Intelligence (cs.AI) |
| DOI | 10.48550/arXiv.2609.01849 |
属性 详情 评论 15 页,5 个图表 主要学科 人工智能 ( cs.AI)DOI 10.48550/arXiv.2609.01849