Sciweavers

2962 search results - page 4 / 593
» Reasoning on Association Rules
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 6 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
SEMWEB
2007
Springer
13 years 12 months ago
Uncertain Reasoning for Creating Ontology Mapping on the Semantic Web
Mapping ontologies with high precision on the Semantic Web is a challenging problem that needs to be addressed in various domains. One of the main problems with any mapping process...
Miklos Nagy, Maria Vargas-Vera, Enrico Motta
ICCSA
2004
Springer
13 years 11 months ago
Exception Rules Mining Based on Negative Association Rules
Exception rules have been previously defined as rules with low interest and high confidence. In this paper a new approach to mine exception rules will be proposed and evaluated. In...
Olena Daly, David Taniar
RSFDGRC
2005
Springer
110views Data Mining» more  RSFDGRC 2005»
13 years 11 months ago
A Rough Set Based Model to Rank the Importance of Association Rules
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, int...
Jiye Li, Nick Cercone
ISIPTA
2003
IEEE
13 years 11 months ago
Combining Belief Functions Issued from Dependent Sources
Dempster’s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speci...
Marco E. G. V. Cattaneo