Sciweavers

439 search results - page 1 / 88
» Filtered-top-k association discovery
Sort
View
PAKDD
2004
ACM
119views Data Mining» more  PAKDD 2004»
13 years 10 months ago
Mining Negative Rules Using GRD
GRD is an algorithm for k-most interesting rule discovery. In contrast to association rule discovery, GRD does not require the use of a minimum support constraint. Rather, the user...
Dhananjay R. Thiruvady, Geoffrey I. Webb
SEMWEB
2005
Springer
13 years 10 months ago
BRAHMS: A WorkBench RDF Store and High Performance Memory System for Semantic Association Discovery
Discovery of semantic associations in Semantic Web ontologies is an important task in various analytical activities. Several query languages and storage systems have been designed ...
Maciej Janik, Krys Kochut
JSW
2008
203views more  JSW 2008»
13 years 4 months ago
Automatic Discovery of Semantic Relations Based on Association Rule
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
Xiangfeng Luo, Kai Yan, Xue Chen
PKDD
2000
Springer
123views Data Mining» more  PKDD 2000»
13 years 8 months ago
Supporting Discovery in Medicine by Association Rule Mining of Bibliographic Databases
The paper presents an interactive discovery support system for the field of medicine. The intended users of the system are medical researchers. The goal of the system is: for a giv...
Dimitar Hristovski, Saso Dzeroski, Borut Peterlin,...
FQAS
2000
Springer
137views Database» more  FQAS 2000»
13 years 8 months ago
Towards the Tractable Discovery of Association Rules with Negations
Frequent association rules (e.g., AB C to say that when properties A and B are true in a record then, C tends to be also true) have become a popular way to summarize huge datasets...
Jean-François Boulicaut, Artur Bykowski, Ba...