MétaCan
Menu
Back to cohort
Record W4236134154 · doi:10.1016/s1571-0661(05)80729-7

Preface

2003· article· en· W4236134154 on OpenAlex

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.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
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

VenueElectronic Notes in Theoretical Computer Science · 2003
Typearticle
Languageen
FieldComputer Science
TopicRough Sets and Fuzzy Logic
Canadian institutionsnot available
Fundersnot available
KeywordsPresentation (obstetrics)Library scienceEvent (particle physics)ChinaComputer scienceOperations researchPolitical scienceEngineeringLaw

Abstract

fetched live from OpenAlex

This volume contains the papers selected for presentation at the Rough Sets in Knowledge Discovery and Soft Computing Workshop (RSKD'2003), held in Warsaw, Poland, April 12-13, 2003. The workshop was organized as one of the satellite events of the European Conference on Theory and Practice of Software (ETAPS'2003). We would like to express our thanks to Professor Damian Niwinski, ETAPS'2003 Workshop Chair, for his invitation to organize the workshop. It is our great pleasure to dedicate this proceedings to Professor Zdzisaw Pawlak, the honorary chair of the RSKD'2003 workshop, who created rough set theory over twenty years ago. We would like also to thank him for enriching our event with his invited talk. In recent years, there have been a number of advances in rough set theory and its applications. Hence, we have witnessed a growing number of international workshops and conferences on rough sets and their applications. Many international conferences are now including rough sets into the list of topics. The RSKD'2003 workshop was intended as a forum for exchanging ideas among experts in rough set theory and its applications, especially in rapidly growing areas like Knowledge Discovery and Data Mining as well as in Soft Computing. The papers, submitted from Canada, China, Great Britain, France, India, Italy, Japan, Russia, Sweden, United States, and Poland, were selected by Program Committee. We would like to express our appreciation to all who submitted papers for presentation and publication in proceedings. Many thanks to the Program Committee Members for reviewing the submitted papers. Special thanks are due to Michael Mislove and Elsevier Publishers for making it possible to include our proceedings in Electronic Notes in Theoretical Computer Science and to Warsaw University for printing the hard copy of our proceedings. April, 2003 Andrzej Skowron and Marcin Szczuka RSKD 2003 Workshop Committee Honorary Chair: Zdzislaw Pawlak Program Chair: Andrzej Skowron Workshop Chair: Marcin Szczuka Program Committee James Alpigini (USA) Malcolm Beynon (UK) Hans Dieter Burkhard (Germany) Andrzej Czyzewski(Poland) Patrick Doherty (Sweden) Ivo Dïntsch (Canada) Maria C. Fernandez (Spain) Jerzy Grzymaa-Busse (USA) Masahiro Inuiguchi (Japan) Jouni Järvinen (Finland) Jan Komorowski (Sweden) Jacek Koronacki (Poland) Bozena Kostek (Poland) Tsau Young Lin (USA) Ernestina Menasalvas-Ruiz (Spain) Mikhail Moshkov (Russia) Tetsuya Murai (Japan) Hung Son Nguyen (Poland) Sinh Hoa Nguyen (Poland) Ewa Orowska (Poland) Sankar K. Pal (India) Witold Pedrycz (Canada) James F. Peters (Canada) Lech Polkowski (Poland) Sheela Ramanna (Canada) Zbigniew E. Ras (USA) Roman Slowinski (Poland) Jerzy Stefanowski (Poland) Jaroslaw Stepaniuk (Poland) Zbigniew Suraj (Poland) Andrzej Szaas (Poland) Marcin Szczuka (Poland) Domik Szlezak (Poland) Roman Swiniarski (USA) Shusaku Tsumoto (Japan) Guoyin Wang (China) Jakub Wróblewski (Poland) Yiyu Yao (Canada) Ning Zhong (Japan) Wojciech Ziarko (Canada).

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.002
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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.791
Threshold uncertainty score0.632

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0020.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.007
GPT teacher head0.238
Teacher spread0.231 · 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