780 search results - page 5 / 156 » Reasoning about sets using redescription mining |
150
Voted
IFIP
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
131
Voted
NCA
2007
IEEE
15 years 2 months ago
2007
IEEE
Based on independent component analysis (ICA) and self-organizing maps (SOM), this paper proposes an ISOM-DH model for the incomplete data’s handling in data mining. Under these ...
174
Voted
HLPPP
1991
15 years 7 months ago
1991
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
109
click to vote
KR
1992
Springer
15 years 7 months ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
153
click to vote
IJCAI
1997
15 years 4 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...