An efficient algorithm for protein sequence pattern mining

Author(s):  
Qingda Zhou ◽  
Qingshan Jiang ◽  
Sheng Li ◽  
Xiaobiao Xie ◽  
Lida Lin
2018 ◽  
Vol 105 (2) ◽  
pp. 673-689 ◽  
Author(s):  
Keon Myung Lee ◽  
Chan Sik Han ◽  
Joong Nam Jun ◽  
Jee Hyong Lee ◽  
Sang Ho Lee

Author(s):  
Dharmarajan K ◽  
M. A. Dorairangaswamy

In this paper, the student navigation paths and student or visitor interested page is identified. Student navigation interest pattern mining contains both the frequently navigation path based on webpage memory size and session length .Relatively comparing access proportion of viewing time and selective page size, preference can be used for mining student learning pattern instead of interested subject. In order to identify Preferred Navigation Paths, an efficient algorithm for Visitor Access Matrix (VAM) by the page to page transition probabilities statistics of all visitor behaviors is introduced in this paper. Second, we propose an efficient algorithm for Selection and Time Preference (SATP) to identify the preference of web pages by viewing time. Third, the user interested page would calculate by both memory size and session. In this way we proposed the Preference of page content size and session identifier algorithm. The performance of the proposed algorithms is evaluated and the algorithms can determine preferred navigation path efficiently. The experimental results show the accuracy and scalability of the algorithms. This approach may be helpful in E-learning, E-business, such as web personalization and website designer


2018 ◽  
Vol 48 (10) ◽  
pp. 2809-2822 ◽  
Author(s):  
Youxi Wu ◽  
Yao Tong ◽  
Xingquan Zhu ◽  
Xindong Wu

Author(s):  
Huiyu Zhou ◽  
Kaoru Shimada ◽  
Shingo Mabu ◽  
Kotaro Hirasawa

Author(s):  
Pradeep Kumar ◽  
Raju S. Bapi ◽  
P. Radha Krishna

Interestingness measures play an important role in finding frequently occurring patterns, regardless of the kind of patterns being mined. In this work, we propose variation to the AprioriALL Algorithm, which is commonly used for the sequence pattern mining. The proposed variation adds up the measure interest during every step of candidate generation to reduce the number of candidates thus resulting in reduced time and space cost. The proposed algorithm derives the patterns which are qualified and more of interest to the user. The algorithm, by using the interest, measure limits the size the candidates set whenever it is produced by giving the user more importance to get the desired patterns.


Sign in / Sign up

Export Citation Format

Share Document