997 search results - page 73 / 200 » Learning Rule Representations from Boolean Data |
89
Voted
EPIA
2003
Springer
15 years 5 months ago
2003
Springer
This paper presents an incremental and scalable learning algorithm in order to mine numeric, low dimensionality, high–cardinality, time–changing data streams. Within the Superv...
120
click to vote
ILP
2007
Springer
15 years 6 months ago
2007
Springer
Machine-generated documents containing semi-structured text are rapidly forming the bulk of data being stored in an organisation. Given a feature-based representation of such data,...
93
Voted
ALGORITHMICA
2005
15 years 16 days ago
2005
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
105
click to vote
OTM
2005
Springer
15 years 6 months ago
2005
Springer
In ubiquitous computing, behavior routine learning is the process of mining the context-aware data to find interesting rules on the user’s behavior, while preference learning tri...
83
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Assuming that a set of source signals is sparsely representable in a given dictionary, we show how their sparse recovery fails whenever we can only measure a convolved observation...