Sciweavers

1998 search results - page 94 / 400
» Basic Association Rules
Sort
View
AI
2003
Springer
14 years 3 months ago
Explanation-Oriented Association Mining Using a Combination of Unsupervised and Supervised Learning Algorithms
We propose a new framework of explanation-oriented data mining by adding an explanation construction and evaluation phase to the data mining process. While traditional approaches c...
Yiyu Yao, Yan Zhao, R. Brien Maguire
COLING
2000
13 years 11 months ago
A Client/Server Architecture for Word Sense Disambiguation
This paper presents a robust client/server implementation of a word sense disambiguator for English. This system associates a word with its meaning in a given context using dictio...
Caroline Brun
JCIT
2008
128views more  JCIT 2008»
13 years 10 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
SYNASC
2008
IEEE
274views Algorithms» more  SYNASC 2008»
14 years 4 months ago
Verbalising R2ML Rules into SBVR
Nowadays, business rules receive a lot of attention from both industry and academia, as they are considered the ideal vehicle for capturing business logic. The purpose of our pape...
Oana Nicolae, Gerd Wagner
LPAR
2004
Springer
14 years 3 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler