arXiv (All)
open access
Laplacian U-Processes for Multiple Change-Point Detection in Dependent Text Networks: An Application to Historical Chinese Articles
We propose a two-view weighted-concordance operator (WCO) framework for offline change-point detection in weakly dependent text networks. Weighted word-co-occurrence graphs yield first-order direct-co-occurrence and second-order shared-context views, projected into paired Euclidean observations usin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Lancaster Corpus of Mandarin Chinese.#315239
- Character Identifying Video Language Alignment Network for Weakly-Supervised Video-Subtitle Moment Retrieval#452228
- Optimal Watermark Localization in Mixed-Source Large Language Model Texts#609322
- Diffusion Language Models for Speech Recognition#14019
- The Trajectory Quotient: Semantic Histories as Paths in the Rank-Fiber Graph#458194
Record · ID 1013903
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive