Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A New and Versatile Method for Association Generation Amihood Amir \Lambda Ronen Feldman y Reuven Kashi z
 

Summary: A New and Versatile Method for Association Generation
Amihood Amir \Lambda Ronen Feldman y Reuven Kashi z
Georgia Tech Bar­Ilan University Bar­Ilan University
and
Bar­Ilan University
Abstract
Current algorithms for finding associations among the attributes describing data in a database
have a number of shortcomings:
1. Their performance time grows dramatically as the minimum support is reduced. Conse­
quently, applications that require associations with very small support have prohibitively
large running times.
2. They assume a static database. Some applications require generating associations in real­
time from a dynamic database, where transactions are constantly being added and deleted.
There are no existing algorithms to accommodate such applications.
3. They can only find associations of the type where a conjunction of attributes implies
a conjunction of different attributes. It turns out that there are many cases where a
conjunction of attributes implies another conjunction only in case certain other attributes
are excluded. To our knowledge, there is no current algorithm that can generate such
excluding associations.
We present a novel method for association generation, that answers all three above desider­

  

Source: Amir, Amihood - Computer Science Department, Bar Ilan University

 

Collections: Mathematics