By Topic

Mining scalable pattern based on temporal logic over data streams

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
$33 $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

3 Author(s)
Yan Tang ; Key Laboratory of Machine Perception (Peking University), Ministry of Education, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China ; Feifei Li ; HongYan Li

In many data stream applications, data segments which are sequential and complicatedly changeable always imply great domain specific value. Especially in the field of medical survey, mining such sequential data segments will help making diagnosis. We discovered that, based on extensive analysis, although containing rich semantics, these data segments are actually composed of some certain basic units, and these units can form different kinds of complex patterns with duplication or lack in certain positions considering a temporal logic. Therefore, we present a scalable pattern mining method. With this method, the Scalable Pattern Tree (SPTree) structure is designed to support the expression of scalable semantics and efficient mining. At last, the experimental results on real datasets prove that our method is feasible and efficient.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference:

29-31 May 2012