An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patterns

Lecture Notes in Computer Science - Germany
doi 10.1007/11733836_9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Skopus: Mining Top-K Sequential Patterns Under Leverage

Data Mining and Knowledge Discovery
Computer NetworksComputer Science ApplicationsInformation SystemsCommunications
2016English

Mining Top-K Closed Sequential Patterns in Sequential Databases

IOSR Journal of Computer Engineering
2013English

An Efficient Fault-Tolerant Scheduling Approach With Energy Minimization for Hard Real-Time Embedded Systems

Cybernetics and Information Technologies
Computer Science
2019English

An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2015English

Incrementally Mining Recently Repeating Patterns Over Data Streams

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Top-K Correlative Graph Mining

2009English

An Efficient Approach for Mining Web Content Sensitivity

International Journal of Knowledge and Web Intelligence
2009English

DSM-TKP: Mining Top-K Path Traversal Patterns Over Web Click-Streams

English

Fault-Tolerant Control for Quadrotor UAV via Backstepping Approach

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy