1998 search results - page 157 / 400 » Basic Association Rules |
104
click to vote
FEGC
2008
15 years 5 months ago
2008
We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergrap...
113
click to vote
ACL
1994
15 years 5 months ago
1994
This paper describes a modular connectionist model of the acquisition of receptive inflectional morphology. The model takes inputs in the form of phones one at a time and outputs ...
145
click to vote
CCGRID
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract Utility Data Center (UDC) provides a exible, coste ective infrastructure to support the hosting of applications for Internet services. In order to enable the design of a \...
139
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent...
123
click to vote
ACL
2008
15 years 5 months ago
2008
Parse-tree paths are commonly used to incorporate information from syntactic parses into NLP systems. These systems typically treat the paths as atomic (or nearly atomic) features...