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

Richard E. Billo

dblp:66/3096 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2015
0000-0001-9180-3383ORCID · corroborated

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

Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Databases, data mining, and information retrieval
1 paper
Data mining · 38% Data integration and cleaning · 38% Query processing and optimization · 23%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning › data preprocessing
attribute value taxonomy
0.112006
Attribute-Level Neighbor Hierarchy Construction Using Evolved Pattern-Based Knowledge Induction · IEEE Trans. Knowl. Data Eng. 2006
Query processing and optimization
approximate query processing
0.012006
Attribute-Level Neighbor Hierarchy Construction Using Evolved Pattern-Based Knowledge Induction · IEEE Trans. Knowl. Data Eng. 2006
Query processing and optimization › interactive query processing
cooperative query answering
0.012006
Attribute-Level Neighbor Hierarchy Construction Using Evolved Pattern-Based Knowledge Induction · IEEE Trans. Knowl. Data Eng. 2006

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

confidence and popularity estimation · 0.1clustering correlation analysis · 0.1
YearPublicationVenuePosition
2015 An Interoperable System for Automated Diagnosis of Cardiac Abnormalities from Electrocardiogram Data
abstract
Electrocardiogram (ECG) data are stored and analyzed in different formats, devices, and computer platforms. As a result, ECG data from different monitoring devices cannot be displayed unless the user has access to the proprietary software of each particular device. This research describes an ontology and encoding for representation of ECG data that allows open exchange and display of ECG data in a web browser. The ontology is based on the Health Level Seven (HL7) medical device communication standard. It integrates ECG waveform data, HL7 standard ECG data descriptions, and cardiac diagnosis rules, providing a capability to both represent ECG waveforms as well as perform automated diagnosis of 37 different cardiac abnormalities. The ECG ontology is encoded in XML, thus allowing ECG data from any digital ECG device that maps to it to be displayed in a general-purpose Internet browser. An experiment was conducted to test the interoperability of the system (ability to openly share ECG data without error in a web browser) and also to assess the accuracy of the diagnosis model. Results showed 100% interoperability using 276 ECG data files and 93% accuracy in diagnosis of abnormal cardiac conditions.
Thidarat Tinnakornsrisuphap, Richard E. Billo
IEEE J. Biomed. Health Informatics2
2006 Attribute-Level Neighbor Hierarchy Construction Using Evolved Pattern-Based Knowledge Induction
abstract
Neighbor knowledge construction is the foundation for the development of cooperative query answering systems capable of searching for close match or approximate answers when exact match answers are not available. This paper presents a technique for developing neighbor hierarchies at the attribute level. The proposed technique is called the evolved pattern-based knowledge induction (ePKI) technique and allows construction of neighbor hierarchies for nonunique attributes based upon confidences, popularities, and clustering correlations of inferential relationships among attribute values. The technique is applicable for both categorical and numerical (discrete and continuous) attribute values. Attribute value neighbor hierarchies generated by the ePKI technique allow a cooperative query answering system to search for approximate answers by relaxing each individual query condition separately. Consequently, users can search for approximate answers even when the exact match answers do not exist in the database (i.e., searching for existing similar parts as part of the implementation of the concepts of rapid prototyping). Several experiments were conducted to assess the performance of the ePKI in constructing attribute-level neighbor hierarchies. Results indicate that the ePKI technique produces accurate neighbor hierarchies when strong inferential relationships appear among data.
Thanit Puthpongsiriporn, J. David Porter, Bopaya Bidanda, Ming-En Wang, Richard E. Billo
IEEE Trans. Knowl. Data Eng.5