3891 search results - page 435 / 779 » Query Models |
126
click to vote
DBPL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At ...
131
click to vote
DEXAW
2004
IEEE
15 years 8 months ago
2004
IEEE
In order to obtain a suitable model of the universe of discourse of some information systems, it is important to allow the description of imprecise objects with temporal indetermi...
138
click to vote
FQAS
2000
Springer
15 years 7 months ago
2000
Springer
- We investigate extensions of the classical measurement of effectiveness in information retrieval systems, precision and recall, to situations where the answer is modeled by a fuz...
131
click to vote
DAM
2008
15 years 4 months ago
2008
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...
169
click to vote
APWEB
2005
Springer
15 years 9 months ago
2005
Springer
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graphstructured XML data brings new challenges because traditi...