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

Ron Musick

dblp:28/1095 · DBLP profile ↗
← Back
12ranked-venue papers
4as first author
0since 2021 · last 2006
—ORCID · none

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

Databases, data management, data science and information retrieval · 6 · 1 first-authorArtificial intelligence and machine learning · 5 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › structure learning › graphical model learning
bayesian network learning
0.011996
Rethinking the Learning of Belief Network Probabilities · KDD 1996
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
parameter estimation
0.011996
Rethinking the Learning of Belief Network Probabilities · KDD 1996
Performance modeling and evaluation
queueing models
0.011992
How Long Will It Take? · AAAI 1992
Performance modeling and evaluation › performance prediction
response time estimation
0.011992
How Long Will It Take? · AAAI 1992

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

subsampling · 0.0decision theory · 0.0
YearPublicationVenuePosition
2006 Machine learning and games
Michael H. Bowling, Johannes Fürnkranz, Thore Graepel, Ron Musick
Mach. Learn.4
2004 MeshSQL: the query language for simulation mesh data
Byung Suk Lee 0001, Ron Musick
Inf. Sci.2
2003 The framework for approximate queries on simulation data
Byung Suk Lee 0001, Terence Critchlow, Ghaleb Abdulla, Chuck Baldwin, Roy Kamimura, Ron Musick, Robert R. Snapp, Nu Ai Tang
Inf. Sci.6
2001 Toward a Query Language on Simulation Mesh Data: An Object-oriented Approach
abstract
As simulation is gaining popularity as an inexpensive means of experimentation in diverse fields of industry and government, the attention to the data generated by scientific simulation is also increasing. Scientific simulation generates mesh data, i.e. data configured in a grid structure, in a sequence of time steps. Its model is complex - understanding it involves mathematical topology and geometry in addition to fields (in the relational sense). Moreover, there is no query language developed on mesh data at all. We develop a comprehensive model of mesh data in an object-oriented manner, propose a set of primitive algebraic operators, show their object-oriented implementation and demonstrate that the well-known object query language OQL (from the ODMG) is powerful enough to express queries on mesh data, whether the queries are on a mesh topology, geometry, fields, or a combination of them. Finally, we discuss some physical implementation issues that are pertinent to executing queries efficiently.
Byung Suk Lee 0001, Robert R. Snapp, Ron Musick
DASFAA3
2001 Experiences applying meta-data to bioinformatics
Terence Critchlow, Ron Musick, Tom Slezak
Inf. Sci.2
2000 DataFoundry: information management for scientific data
abstract
Data warehouses and data marts have been successfully applied to a multitude of commercial business applications. They have proven to be invaluable tools by integrating information from distributed, heterogeneous sources and summarizing this data for use throughout the enterprise. Although the need for information dissemination is as vital in science as in business, working warehouses in this community are scarce because traditional warehousing techniques do not transfer to scientific environments. There are two primary reasons for this difficulty. First, schema integration is more difficult for scientific databases than for business sources, because of the complexity of the concepts and the associated relationships. While this difference has not yet been fully explored, it is an important consideration when determining how to integrate autonomous sources. Second, scientific data sources have highly dynamic data representations (schemata). When a data source participating in a warehouse changes its schema, both the mediator transferring data to the warehouse and the warehouse itself need to be updated to reflect these modifications. The cost of repeatedly performing these updates in a traditional warehouse, as is required in a dynamic environment, is prohibitive. This paper discusses these issues within the context of the DataFoundry project, an ongoing research effort at Lawrence Livermore National Laboratory. DataFoundry utilizes a unique integration strategy to identify corresponding instances while maintaining differences between data from different sources, and a novel architecture and an extensive meta-data infrastructure, which reduce the cost of maintaining a warehouse.
Terence Critchlow, Krzysztof Fidelis, Madhavan Ganesh, Ron Musick, Tom Slezak
IEEE Trans. Inf. Technol. Biomed.4
1998 Meta-Data Based Mediator Generation
abstract
Mediators are a critical component of any data warehouse; they transform data from source formats to the warehouse representation while resolving semantic and syntactic conflicts. The close relationship between mediators and databases requires a mediator to be updated whenever an associated schema is modified. Failure to quickly perform these updates significantly reduces the reliability of the warehouse because queries do not have access to the most current data. This may result in incorrect or misleading responses, and reduce user confidence in the warehouse. Unfortunately, this maintenance may be a significant undertaking if a warehouse integrates several dynamic data sources. This paper describes a meta-data framework, and associated software, designed to automate a significant portion of the mediator generation task and thereby reduce the effort involved in adapting to schema changes. By allowing the DBA to concentrate on identifying the modifications at a high level, instead of reprogramming the mediator, turnaround time is reduced and warehouse reliability is improved.
Terence Critchlow, Madhavan Ganesh, Ron Musick
CoopIS3
1997 Editorial
Paul E. Stolorz, Ron Musick
Data Min. Knowl. Discov.2
1996 Rethinking the Learning of Belief Network Probabilities
Ron Musick
KDD1
1993 Decision Theoretic Subsampling for Induction on Large Databases
Ron Musick, Jason Catlett, Stuart Russell 0001
ICML1
1993 Minimal Assumption Distribution Propagation in Belief Networks
Ron Musick
UAI1
1992 How Long Will It Take?
Ron Musick, Stuart Russell 0001
AAAI1