Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bon K. Sy

dblp:30/2727 · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
0since 2021 · last 2014
0000-0001-8827-2702ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorSecurity and privacy · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 38% Knowledge representation and reasoning · 38% Graph learning · 23%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
bayesian network inference
0.011992
Reasoning MPE to Multiply Connected Belief Networks Using Message Passing · AAAI 1992
Machine learning › Graph learning › graph neural network
message passing
0.011992
Reasoning MPE to Multiply Connected Belief Networks Using Message Passing · AAAI 1992
Knowledge, reasoning and agents › Knowledge representation and reasoning
probabilistic reasoning
0.011992
Reasoning MPE to Multiply Connected Belief Networks Using Message Passing · AAAI 1992
Knowledge, reasoning and agents › Knowledge representation and reasoning
qualitative reasoning
0.011989
Qualitative Reasoning of Bayesian Belief Using Meta-knowledge · IJCAI 1989

Methods — techniques the papers use, named apart from their topics

message passing · 0.0
YearPublicationVenuePosition
2014 Privacy Preserving Biometric Voice Authentication System - SIPPA-based Approach
Bon K. Sy
ICSEng1
2012 SIPPA-2.0 - Secure information processing with privacy assurance (version 2.0)
abstract
We present a two-party secure information processing protocol referred to as SIPPA-2.0 - targeted towards privacy preserving biometric data comparison and reconstruction. The original intention of SIPPA as reported previously is to enable private data comparison and reconstruction between a client and a server when (a) the client possesses some data that are “sufficiently similar” to that of the server, and (b) the server provides a scalar helper data to facilitate private data reconstruction by the client. In SIPPA-2.0, private data comparison and reconstruction are based on new theoretical results and a novel secure computation protocol referred to as SLSSP. These new results allow us to design and develop the much improved SIPPA and SLSSP protocols guaranteeing (a) security under semi-malicious model rather than just semi-honest model, and (b) privacy assurance with arbitrary reconstruction accuracy controllable by the server. Security analysis proving SLSSP secure under the semi-honest and semi-malicious models is presented. SIPPA-2.0 is applied to enable privacy preserving fingerprint comparison; where two parties can compare their fingerprint samples and can obtain a similarity score without revealing their raw fingerprint to each other. Experimental results on the accuracy of fingerprint matching and the run-time performance are also reported.
Arun Prakash, Kumara Krishnan, Bon K. Sy
PST3
2010 Secure Information Processing with Privacy Assurance - standard based design and development for biometric applications
abstract
This paper presents the design and development of a technique referred to as SIPPA - Secure Information Processing with Privacy Assurance - for biometric data reconstruction. SIPPA enables a client/server model with the following two properties: (1) the client party can compare the similarity between his/her sample data with the source data on the server side — without each party revealing his/her data to another, nor to a third party. If the sample data is “sufficiently similar” to the source data, the client can reconstruct the source data by using only the sample data and some helper data with negligible overhead provided by the server. The main contributions of this paper are: (1) algorithmic steps of SIPPA and its relationship to privacy homomorphism, (2) a parallel SIPPA architecture, and (3) the realization of parallel SIPPA as a service component for BioAPI 2.0 framework using Java RMI technology. To demonstrate its potential application, we apply SIPPA to the reconstruction of biometric data, and more specifically, biometric face images represented in terms of linearized vectors.
Bon K. Sy, Adam Ramirez, Arun Prakash Kumara Krishnan
PST1
2002 A Theoretical Foundation and a Method for Document Table Structure Extraction and Decompositon
Howard C. Wasserman, Keitaro Yukawa, Bon K. Sy, Kui-Lam Kwok, Ihsin T. Phillips
Document Analysis Systems3
1993 A recurrence local computation approach towards ordering composite beliefs in bayesian belief networks
Bon K. Sy
Int. J. Approx. Reason.1
1992 Reasoning MPE to Multiply Connected Belief Networks Using Message Passing
Bon K. Sy
AAAI1
1989 Qualitative Reasoning of Bayesian Belief Using Meta-knowledge
Bon K. Sy
IJCAI1
1988 Integrating uncertain speech evidence into a knowledge-based message generation system for the nonverbal, severely motor disabled
abstract
An intelligent communication device is being developed to assist the nonverbal, motor disabled in the generation of written and spoken messages. The device is based on a knowledge base of the grammatical rules and message elements. A 'belief' reasoning scheme makes use of highly uncertain speech-recognition information in combination with the embedded knowledge to optimize the process of message search. The authors focus on the integration of that speech information. Experimental testing of a prototype system to assess the effects of speech evidence is discussed.>
John R. Deller Jr., Bon K. Sy
ICASSP2
1988 A frame architecture for a certain class of graph search problems
abstract
A frame control strategy is presented which directs an efficient graph search when information available for finding a path is distributed throughout the graph. The frame structure requires (worst case) only O(K/sup N/) memory size instead of O(K/sup 2N/), which is needed for a matrix representation of an N-level, K-branch tree graph. An efficiency analysis is detailed, and its application to a communication system for the nonverbal, severely motor disabled is discussed.>
Bon K. Sy, John R. Deller Jr.
IEEE Trans. Syst. Man Cybern.1