Filters

6,755 Hits in 7.9 sec

### Page 3369 of Mathematical Reviews Vol. , Issue 92f [page]

1992 Mathematical Reviews
(I-IASI) A unique formal system for binary decompositions of database relations, probability distributions, and graphs. Inform. Sci. 59 (1992), no. 1-2, 21-52.  ...  Summary: “It is shown that the formal system for binary de- compositions of database relations applies successfully to binary decompositions of probability distributions and graphs too.  ...

### Decomposing a relation into a tree of binary relations

Rina Dechter
1990 Journal of computer and system sciences (Print)
We present an efficient algorithm for decomposing an n-ary relation into a tree of binary relations and provide a simple test for checking whether or not the tree formed by the algorithm represents the  ...  The method was motivated by an algorithm developed by Chow and Liu [3] for approximating discrete probability distributions with dependence tree. Related work is presented in [13-151.  ...  I thank the students, Bit Moshe and Ronit Nadam, who implemented the tree-decomposition algorithm and provided the experimental results presented in the paper. I also thank the referees of this paper.  ...

### Relational Models [article]

Volker Tresp, Maximilian Nickel
2016 arXiv   pre-print
Relational models have applications in social networks analysis, the modeling of knowledge graphs, bioinformatics, recommendation systems, natural language processing, medical decision support, and linked  ...  We provide a survey on relational models. Relational models describe complete networked domains by taking into account global dependencies in the data.  ...  The goal of relational learning is to derive a model of this probability distribution. In a canonical representation, we assign a binary random variable X R,t to each possible tuple in each relation.  ...

### Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances

Mikaël Monet
2016 Proceedings of the 2016 on SIGMOD'16 PhD Symposium - SIGMOD'16 PhD
The reason is that of complexity and performance: on arbitrary relational database instances annotated with probabilities, performing exact probabilistic query evaluation is hard.  ...  However, a criterion on the shape of the database has been shown in recent work to be sufficient and in some sense necessary to the tractability of this task.  ...  This gives us a database on a signature containing only three binary relation symbols, with treewidth 1.  ...

### Relational Models [chapter]

Volker Tresp, Maximilian Nickel
2016 Encyclopedia of Social Network Analysis and Mining
In a probabilistic database, a probability distribution is defined over all possible worlds under consideration.  ...  Entities, relationships and attributes are defined in the entity-relationship model, which is used in the design of a formal relational model Relation A relation or relation instance I(R) is a finite set  ...  Possible Worlds for Relational Models A set of possible worlds or an incomplete database is a set of database instances (or worlds) and a probabilistic database defines a probability distribution over  ...

### Relational Models [chapter]

Volker Tresp, Maximilian Nickel
2018 Encyclopedia of Social Network Analysis and Mining
In a probabilistic database, a probability distribution is defined over all possible worlds under consideration.  ...  Entities, relationships and attributes are defined in the entity-relationship model, which is used in the design of a formal relational model Relation A relation or relation instance I(R) is a finite set  ...  Possible Worlds for Relational Models A set of possible worlds or an incomplete database is a set of database instances (or worlds) and a probabilistic database defines a probability distribution over  ...

### Relational Models [chapter]

Volker Tresp, Maximilian Nickel
2014 Encyclopedia of Social Network Analysis and Mining
In a probabilistic database, a probability distribution is defined over all possible worlds under consideration.  ...  Entities, relationships and attributes are defined in the entity-relationship model, which is used in the design of a formal relational model Relation A relation or relation instance I(R) is a finite set  ...  Possible Worlds for Relational Models A set of possible worlds or an incomplete database is a set of database instances (or worlds) and a probabilistic database defines a probability distribution over  ...

### Human motion database with a binary tree and node transition graphs

K. Yamane, Y. Yamaguchi, Y. Nakamura
2009 Robotics: Science and Systems V
We develop an efficient method for building a binary tree data structure from a set of continuous, multi-dimensional motion clips.  ...  Each node of the tree represents a statistical distribution of a set of human figure states extracted from the motion clips.  ...  The authors gratefully acknowledge the support by the Ministry of Education, Culture, Sports, Science and Technology, Japan through the Special Coordination Funds for Promoting Science and Technology,  ...

### A Tensor Based Data Model for Polystore: An Application to Social Networks Data [article]

Eric Leclercq, Marinette Savonnet
2018 arXiv   pre-print
In this article, we show how the mathematical object tensor can be used to build a multi-paradigm model for the storage of social data in data warehouses.  ...  Therefore, systems can take advantage of multiple data models both in terms of query execution performance and the semantic expressiveness of data representation.  ...  Data are stored in JSON file format in HDFS, most important attributes of tweets are stored in a relational database in a unique table and in another database with a schema in third normal form.  ...

### Page 1028 of Mathematical Reviews Vol. , Issue 93b [page]

1993 Mathematical Reviews
(CS-CSAV-I) Comment on: “A unique formal system for binary decompositions of database relations, probability distributions, and graphs” [Inform.  ...  The logic com- ponent of a deductive database is an application-specific relational database and the control component implements the database al- gorithm which performs the deductive process for computing  ...

### Human motion database with a binary tree and node transition graphs

Katsu Yamane, Yoshifumi Yamaguchi, Yoshihiko Nakamura
2010 Autonomous Robots
We develop an efficient method for building a binary tree data structure from a set of continuous, multi-dimensional motion clips.  ...  Each node of the tree represents a statistical distribution of a set of human figure states extracted from the motion clips.  ...  The authors gratefully acknowledge the support by the Ministry of Education, Culture, Sports, Science and Technology, Japan through the Special Coordination Funds for Promoting Science and Technology,  ...

### Page 810 of Mathematical Reviews Vol. , Issue 86b [page]

1986 Mathematical Reviews
the power of formal systems of reasoning (pp. 364 369); L.  ...  Mitrani, Fixed- point approximations for distributed systems (pp. 245-257); Rolf Schassberger, An aggregation principle for computing invariant probability vectors in semi-Markovian models (pp. 259-273  ...

### Diverse dimension decomposition for itemset spaces

Mikalai Tsytsarau, Francesco Bonchi, Aristides Gionis, Themis Palpanas
2012 Knowledge and Information Systems
We introduce the problem of diverse dimension decomposition in transactional databases, where a dimension is a set of mutually exclusive itemsets.  ...  The problem we consider requires to find a decomposition of the itemset space into dimensions, which are orthogonal to each other and which provide high coverage of the input database.  ...  Francesco Bonchi and Aristides Gionis were partially supported by the Torres Quevedo Program of the Spanish Ministry of Science and Innovation, co-funded by the European Social Fund, and by the Spanish  ...

### An Indexing Framework for Queries on Probabilistic Graphs

Silviu Maniu, Reynold Cheng, Pierre Senellart
2017 ACM Transactions on Database Systems
In the weight-distribution model, each edge is associated with a probability distribution of weight values [28] .  ...  For example, the traveling time between two vertices in a road network can be represented by a normal distribution.  ...  ACKNOWLEDGMENTS Reynold Cheng and Silviu Maniu were supported by the Research Grants Council of HK (Project HKU 17205115 and 17229116) and HKU (Projects 102009508 and 104004129) .  ...

### A Method for Assigning Probability Distributions in Attack Simulation Languages

Wenjun Xiong, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Brinellvägen 8, 114 28 Stockholm, Sweden, Simon Hacks, Robert Lagerström, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Brinellvägen 8, 114 28 Stockholm, Sweden, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Brinellvägen 8, 114 28 Stockholm, Sweden
2021 Complex Systems Informatics and Modeling Quarterly
Cyber attacks on IT and OT systems can have severe consequences for individuals and organizations, from water or energy distribution systems to online banking services.  ...  To address this gap, we propose a method to assign probability distributions to the attack steps and defenses of MAL-based languages.  ...  Acknowledgements The authors would like to thank Quentin Biharé and Love Wessman for their contributions to the project and helpful discussions.  ...
« Previous Showing results 1 — 15 out of 6,755 results