MétaCan
Menu
Back to cohort
Record W3124125866

Buddy Bots: How Turing's Fast Friends are Under-Mining Consumer Privacy

2005· article· en· W3124125866 on OpenAlexaff
Ian R. Kerr, Marcus Bornfreund

Bibliographic record

VenueSSRN Electronic Journal · 2005
Typearticle
Languageen
FieldComputer Science
TopicDiverse Interdisciplinary Research Studies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsInternet privacyProfiling (computer programming)Consumer privacyConversationAutomationComputer securityComputer scienceBusinessInformation privacyEngineeringPsychology
DOInot available

Abstract

fetched live from OpenAlex

Intelligent agents are currently being deployed in virtual environments to enable interaction with consumers in furtherance of various corporate strategies involving marketing, sales and customer service. Some online businesses have recently begun to adopt automation technologies that are capable of altering both their own, and consumers', legal rights and obligations. In a rapidly evolving field known as affective computing, the creators of some automation technologies are utilizing various principles of cognitive science and artificial intelligence to generate avatars capable of garnering consumer trust. Unfortunately, this trust has been exploited by some to undertake extensive, clandestine consumer profiling under the guise of friendly conversation. Buddy bots and other such applications have been used by businesses to collect valuable personal information and private communications without lawful consent. This article critically examines such practices and provides basic consumer protection principles, an adherence to which promises to generate a more socially-responsible vision of the application of artificial intelligence in automated electronic commerce.

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.005
metaresearch head score (Gemma)0.024
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.012
Threshold uncertainty score0.040

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.024
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0100.017
Scholarly communication0.0100.019
Open science0.0020.005
Research integrity0.0060.006
Insufficient payload (model declined to judge)0.0120.004

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.021
GPT teacher head0.284
Teacher spread0.262 · 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 designNot applicable
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

Citations24
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueSSRN Electronic JournalSame topicDiverse Interdisciplinary Research StudiesFrench-language works237,207