No abstract

The main challenge of problem lies in the perception of Cognitive Radio technology is to discover licensed empty spectrum pattern. The efficient model is needed for allocation among licensed and unlicensed users in wireless spectrum to improve the extraction rate and collision rate. To discover the spectrum hole in spectrum paging bands, stirred by FP mining technique proposed an efficient enumeration approach, namely Constraint Based Frequent Periodic Pattern Mining (CBFPP). The proposed algorithm uses TRIE-like data structure with data mining constraints. CBFPP algorithm predicts periodic spectrum occupancy holes in the paging bands. It is shown that CBFPP has a high prediction accuracy with reasonable time complexity. Experiment with synthetic and real data validate higher prediction accuracy and with reasonable time complexities. The unlicensed user utilizes the predicted spectrum pattern in spectrum usage of channel without significant interference to licensed users.

The search for the periodicity in time-series database has a number of application, is an interesting data mining problem. In real world dataset are mostly noisy and rarely a perfect periodicity, this problem is not trivial. Periodicity is very common practice in time series mining algorithms, since it is more likely trying to discover periodicity signal with no time limit. We propose an algorithm uses FP-tree for finding symbol, partial and full periodicity in time series. We designed the algorithm complexity as O (kN), where N is the length of input sequence and k is length of periodic pattern. We have shown our algorithm is fixed parameter tractable with respect to fixed symbol set size and fixed length of input sequences. Experiment results on both synthetic and real data from different domains have shown our algorithms' time efficient and noise-resilient feature. A comparison with some current algorithms demonstrates the applicability and effectiveness of the proposed algorithm.

No abstract

No abstract