MétaCan
Menu
Back to cohort
Record W2389737509

The Algorithm of New Conception Discovery Based on Indexing Information

2007· article· en· W2389737509 on OpenAlex
Gongshen Liu

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueMicrocomputer applications · 2007
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Computational Techniques and Applications
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceSearch engine indexingString (physics)The InternetField (mathematics)String searching algorithmCharacter (mathematics)Process (computing)Information retrievalWord (group theory)AlgorithmData miningInformation processingArtificial intelligencePattern matchingWorld Wide Web
DOInot available

Abstract

fetched live from OpenAlex

The discovery and recognition of network new conception is a fundamental technology in the field of information processing ,which can help sensing publicinterests in Internet and recognizing Internet interesting information. Because of using indexing information rationally, it can process a mass of Information with the algorithm proposed in this paper. In order to improve the precision of new conceptiondiscovery, the algorithm adopts not only the technology of traditional word segmentatio-nand string frequency statistics, but also automatic combination of Chinese character components and the string co-occurrence between websites. It's proved by experiments that 75 percent of the potential new conception is acceptable. The new algorithm can thoroughly meet the requirementsof the application of information processing.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.802
Threshold uncertainty score0.396

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.008
GPT teacher head0.268
Teacher spread0.260 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it