Sciweavers

1998 search results - page 152 / 400
» Basic Association Rules
Sort
View
151
Voted
DAWAK
2010
Springer
15 years 3 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
JDWM
2010
139views more  JDWM 2010»
15 years 1 months ago
Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
Panagiotis Giannikopoulos, Iraklis Varlamis, Magda...
ICMCS
2005
IEEE
127views Multimedia» more  ICMCS 2005»
15 years 8 months ago
Current and Emerging Topics in Sports Video Processing
Sports video processing is an interesting topic for research, since the clearly defined game rules in sports provide the rich domain knowledge for analysis. Moreover, it is intere...
Xinguo Yu, Dirk Farin
114
Voted
WSC
2000
15 years 4 months ago
VisualSLX: an open user shell for high-performance modeling and simulation
SLX by Wolverine software is actually one of the fastest simulation languages. Besides the high performance the SLX-compiler can be extended very easily by user specific syntax ru...
Thomas Wiedemann
LOGCOM
2006
58views more  LOGCOM 2006»
15 years 2 months ago
Proof Theory for Casari's Comparative Logics
Comparative logics were introduced by Casari in the 1980s to treat aspects of comparative reasoning occurring in natural language. In this paper Gentzen systems are defined for the...
George Metcalfe