MétaCan
Menu
Back to cohort
Record W3182789081

Discovering spatial associations in images

2000· article· en· W3182789081 on OpenAlexaff
Osmar R. Zai͏̈ane, Jiawei Han

Bibliographic record

VenueProceedings of SPIE - The International Society for Optical Engineering · 2000
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceFocus (optics)Association rule learningAbstractionFeature (linguistics)Data miningProcess (computing)ScalabilityAssociation (psychology)Information retrievalSpatial analysisArtificial intelligenceGeographyDatabase
DOInot available

Abstract

fetched live from OpenAlex

In this paper, our focus in data mining is concerned with the discovery of spatial associations within images. Our work concentrates on the problem of finding associations between visual content in large image databases. Discovering association rules has been the focus of many studies in the last few years. However, for multimedia data such as images or video frames, the algorithms proposed in the literature are not sufficient since they miss relevant frequent item-sets due to the peculiarity of visual data, like repetion of features, resolution levels, etc. We present in this paper an approach for mining spatial relationships from large visual data repositories. The approach proceeds in three steps: feature localization, spatial relationship abstraction, and spatial association discovery. The mining process considers the issue of scalability and contemplates various feature localization abstactions at different resolution levels.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0080.007
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.009
GPT teacher head0.232
Teacher spread0.223 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations0
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of SPIE - The International Society for Optical EngineeringSame topicData Mining Algorithms and ApplicationsFrench-language works237,207