Sciweavers

997 search results - page 18 / 200
» Learning Rule Representations from Boolean Data
Sort
View
AROBOTS
1999
110views more  AROBOTS 1999»
15 years 4 days ago
Self-Localization of Autonomous Robots by Hidden Representations
We present a framework for constructing representations of space in an autonomous agent which does not obtain any direct information about its location. Instead the algorithm relie...
J. Michael Herrmann, Klaus Pawelzik, Theo Geisel
KDD
1998
ACM
183views Data Mining» more  KDD 1998»
15 years 4 months ago
Mining Generalized Association Rules and Sequential Patterns Using SQL Queries
Database integration of mining is becoming increasingly important with tile installation of larger and larger data warehouses built around relational database technology. Most of ...
Shiby Thomas, Sunita Sarawagi
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 26 days ago
Identifying bridging rules between conceptual clusters
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
Shichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhan...
FBIT
2007
IEEE
15 years 6 months ago
Rough Set Based Information Retrieval from Argumentative Data Points in Weblogs
This paper describes a decision tree model and 3dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are consi...
Sea Woo Kim, Chin-Wan Chung
103
Voted
IJCNN
2000
IEEE
15 years 4 months ago
Extracting Distributed Representations of Concepts and Relations from Positive and Negative Propositions
Linear Relational Embedding (LRE) was introduced (Paccanaro and Hinton, 1999) as a means of extracting a distributed representation of concepts from relational data. The original ...
Alberto Paccanaro, Geoffrey E. Hinton