Robustness of regional matching scheme over global matching scheme

DOI10.1016/S0004-3702(02)00366-1zbMath1079.68618OpenAlexW2042145505MaRDI QIDQ814437

Naoyuki Tokuda, Liang Chen

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00366-1

zbMATH Keywords

Decision makingStabilityPattern recognitionNoiseVotingGlobal matchingRegional matching

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Voting theory (91B12) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

ROBUSTNESS INSTEAD OF ACCURACY SHOULD BE THE PRIMARY OBJECTIVE FOR SUBJECTIVE PATTERN RECOGNITION RESEARCH: STABILITY ANALYSIS ON MULTICANDIDATE ELECTORAL COLLEGE VERSUS DIRECT POPULAR VOTE ⋮ A general stability analysis on regional and national voting schemes against noise -- why is an electoral college more stable than a direct popular election?

Cites Work

• Principal component analysis.
• Approximation schemes for covering and packing problems in image processing and VLSI
• Unnamed Item
• Unnamed Item

This page was built for publication: Robustness of regional matching scheme over global matching scheme