Abstract
The author identifies inference aggregation and cardinality aggregation as two distinct aspects of the aggregation problem. He develops the concept of a semantic relationship graph to describe the relationships between data and then presents inference aggregation as the problem of finding alternative paths between vertices on the graph. He presents an algorithm for processing the semantic relationship graph to discover whether potential inference aggregation problems exist. A method of detecting some aggregation conditions within the database management system (DBMS) is presented that uses the normal DBMS query language and adds additional catalytic data to the DBMS to permit a query to make the inference. The author also suggests the use of set theory to describe aggregation conditions and the addition of set operations to the DBMS to permit the description of aggregation detection queries.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Related Publications
On ordered weighted averaging aggregation operators in multicriteria decisionmaking
The author is primarily concerned with the problem of aggregating multicriteria to form an overall decision function. He introduces a type of operator for aggregation called an ...
Microdata disclosure limitation in statistical databases: query size and random sample query control
A probabilistic framework can be used to assess the risk of disclosure of confidential information in statistical databases that use disclosure control mechanisms. The authors s...
Aggregation and inference: facts and fallacies
The author examines inference and aggregation problems that can arise in multilevel relational database systems and points out some fallacies in current thinking about these pro...
Self-organising multilayer topographic mappings
Minimization of distortion measures requires multilayer mappings to be topographic. The author shows this only for tree-like multilayer networks. He also shows how to modify the...
An improved elastic net method for the traveling salesman problem
An elastic net method is presented for finding traveling-salesman tours; the method improves on the convergence properties of a recent model proposed by R. Durbin and D. Willsha...
Publication Info
- Year
- 2003
- Type
- article
- Pages
- 96-106
- Citations
- 110
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/secpri.1988.8101