Sciweavers

1453 search results - page 76 / 291
» Mining for Useful Association Rules Using the ATMS
Sort
View
IDEAL
2003
Springer
14 years 27 days ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
IDA
2000
Springer
13 years 7 months ago
Reducing redundancy in characteristic rule discovery by using integer programming techniques
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
Tom Brijs, Koen Vanhoof, Geert Wets
BROADBAND
1998
13 years 9 months ago
Traffic management in an ATM multi-service switch for workgroups
ATM switches have to provide traffic management functions to meet the QoS requirements of different service categories. Among the traffic management functions we will focus on con...
Stefan Bodamer, Thomas Renger, Georg Röß...
COMPSAC
2004
IEEE
13 years 11 months ago
Efficient Partial Multiple Periodic Patterns Mining without Redundant Rules
Partial periodic patterns mining is a very interesting domain in data mining problem. In the previous studies, full and partial multiple periodic patterns mining problems are cons...
Wenpo Yang, Guanling Lee