Sciweavers

2314 search results - page 156 / 463
» Monoids over domains
Sort
View
MFCS
2009
Springer
16 years 1 months ago
Future-Looking Logics on Data Words and Trees
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
Diego Figueira, Luc Segoufin
ICDM
2007
IEEE
254views Data Mining» more  ICDM 2007»
16 years 1 months ago
Sampling for Sequential Pattern Mining: From Static Databases to Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery. Recently, with the constant progress in hardware technologies, real-world databases tend to gro...
Chedy Raïssi, Pascal Poncelet
OTM
2005
Springer
16 years 9 days ago
Reasoning on Dynamically Built Reasoning Space with Ontology Modules
Several applications require reasoning over autonomously developed ontologies. Initially conceived to explicit the semantics of a certain domain, these ontologies become a powerfu...
Fabio Porto
EWCBR
2004
Springer
16 years 6 days ago
Dynamic Critiquing
Abstract. Critiquing is a powerful style of feedback for case-based recommender systems. Instead of providing detailed feature values, users indicate a directional preference for a...
James Reilly, Kevin McCarthy, Lorraine McGinty, Ba...
EWCBR
2006
Springer
15 years 10 months ago
Fast Case Retrieval Nets for Textual Data
Case Retrieval Networks (CRNs) facilitate flexible and efficient retrieval in Case-Based Reasoning (CBR) systems. While CRNs scale up well to handle large numbers of cases in the c...
Sutanu Chakraborti, Robert Lothian, Nirmalie Wirat...