A Tree-Shaped Fuzzy Clustering Answer Retrieval Model Based on Question Alignment
Bibliographic record
Abstract
Open domain question answering (QA) refers to the model that can retrieve multiple supporting documents related to the answer from comprehensive knowledge bases. The difficulties lie in discovering the semantic logic relationship between supporting documents and providing explainable reasoning processes. Current retrieval models rely heavily on the scale of parameters in text embedding and iterative optimization, resulting in high training costs and a lack of interpretability. Given the challenges outlined above, this article proposes an unsupervised tree-shaped axiomatic fuzzy set (AFS) clustering model with semantic framework, tailored for open-domain answer prediction. Unlike traditional rule-based methods that require repeated iterations leading to complex computational overhead, the hierarchical single-feature clustering model proposed in this article achieves high retrieval efficiency and semantic interpretability. Moreover, a retrieval strategy based on tree-structured clustering semantic descriptions for unsupervised question alignment reasoning paths is introduced, effectively enhancing the capacity for intricate reasoning of the model. The application of the AFS clustering theory to information retrieval with the single feature tree clustering method is original. Experimental results on three open domain QA datasets show the superiority of the proposed model.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".