Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A paradigm for detecting cycles in large data sets via fuzzy mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Buckley, J.P. ; Dept. of Comput. Sci., Dayton Univ., OH, USA ; Seitzer, J.

Traditional data mining algorithms identify associations in data that are not explicit. Cycle mining algorithms identify meta-patterns of these associations depicting inferences forming chains of positive and negative rule dependencies. This paper describes a formal paradigm for cycle mining using fuzzy techniques. To handle cycle mining of large data sets, which are inherently noisy, we present the α-cycle and β-cycle, the underlying formalism of the paradigm. Specifically, we show how α-cycles, desirable cycles, can be reinforced such that complete positive cycles are created, and how β-cycles can be identified and weakened. To accomplish this, we introduce the concept of Ω nodes that employ an alterability quantification, as well as using standard rule and node weighting (with associated thresholds)

Published in:

Knowledge and Data Engineering Exchange, 1999. (KDEX '99) Proceedings. 1999 Workshop on

Date of Conference:

1999