Mining Best-N Frequent Patterns in a Video Sequence
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 11
Abstract
Video mining is used to discover and describe interesting patterns in video data, which has become one of the core problem areas of the data mining research community. Compared to the mining of other types of data (e.g., text), video mining is still in its infancy, and an under-explored field. There are many challenging research problems facing video mining. Video Association Mining is a relatively new and emerging research trend. It consists two key phases are (i) Video pre-processing and (ii) Frequent Temporal Pattern Mining. The first phase converts the original input video to a sequence format. The second phase concerns the generation of frequent patterns. Frequent pattern generation plays an essential role in mining of association rules. The usual framework is to use a minimal support threshold to obtain all frequent patterns. However, it is nontrivial for users to choose a suitable minimal support threshold. The paper addresses the issue of frequent temporal pattern mining and studies algorithms for the same. In this paper, we proposed a new mining task called mining Best-N frequent patterns, where N is the largest rank value of all frequent patterns to be mined. An efficient algorithm called Modified VidApriori is used to mining Best-N frequent patterns. During the mining process, the undesired patterns are filtered and useful patterns are selected to generate other longer potential frequent patterns. This strategy greatly reduces the search space. The existing Apriori based algorithm is compared with Modified VidApriori. We also presented results of applying these algorithms to a synthetic data set, which show the effectiveness of our algorithm.
Authors and Affiliations
Vijayakumar. V , Nedunchezhian. R
Keywords
Related Articles
- EP ID EP103027
- DOI -
- Views 140
- Downloads 0
Power Aware Scheduling for Resource Constrained Distributed Real-Time Systems
Power management has become popular in mobile omputing as well as in server farms. Although a lot of work has been done to manage the energy consumption on uniprocessor real-time systems, there is less work done on thei...
Harnessing Genetic Algorithm for Vertex Cover Problem
The problem of finding a minimum vertex cover is an NP hard optimization problem. Some approximation algorithms for the problem have been proposed but most of them are neither optimal nor complete. The work proposes the...
Trust Based Load Distribution in a Data Grid Environment
The basic idea of a load balancing system is to transfer partial of system workload from busy nodes to some idle nodes. The target resource selection for task migration is a key factor in the load balance strategy. As gr...
Modeling Academic Performance Evaluation Using Soft Computing Techniques: A Fuzzy Logic Approach
We have proposed a Fuzzy Expert System (FES) for student academic performance evaluation based on fuzzy logic techniques. A suitable fuzzy inference mechanism and associated rule has been discussed. It introduces the pri...
REVIEW of SOME MINIMUM-PROCESS SYNCHRONOUS CHECKPOINTING SCHEMES for MOBILE DISTRIBUTED SYSTEMS
The term Distributed Systems is used to describe a system with the following characteristics: i) it consists of several computers that do not share memory or a clock, ii) the computers ommunicate with each other by exch...