scholarly journals Dynamic search-space pruning techniques in path sensitization

Author(s):  
João P. Marques Silva ◽  
Karem A. Sakallah
Author(s):  
Tobias Kaminski ◽  
Thomas Eiter ◽  
Katsumi Inoue

Meta-Interpretive Learning (MIL) is a recent approach for Inductive Logic Programming (ILP) implemented in Prolog. Alternatively, MIL-problems can be solved by using Answer Set Programming (ASP), which may result in performance gains due to efficient conflict propagation. However, a straightforward MIL-encoding results in a huge size of the ground program and search space. To address these challenges, we encode MIL in the HEX-extension of ASP, which mitigates grounding issues, and we develop novel pruning techniques.


2010 ◽  
Vol 26-28 ◽  
pp. 118-122
Author(s):  
Chong Huan Xu ◽  
Chun Hua Ju

According to the features of data streams and combined sliding window, a new algorithm A-MFI which is based on self-adjusting and orderly-compound policy for mining maximal frequent itemsets in data stream is proposed. This algorithm which is based on basic window updates information from data stream flow fragments and scans the stream only once to gain and store it in frequent itemsets list when the data stream flows. The core idea of this algorithm: construct self-adjusting and orderly-compound FP-tree, use mixed subset pruning techniques to reduce the search space, merge nodes which has equal minsup in the same branch and compress to generate the orderly-compound FP-tree to avoid superset checking when mining maximal frequent itemsets. The experimental results show that the algorithm has higher efficiency in time and space, and also has good scalability.


Author(s):  
Yunhui Zheng ◽  
Vijay Ganesh ◽  
Sanu Subramanian ◽  
Omer Tripp ◽  
Julian Dolby ◽  
...  

1994 ◽  
Vol 25 (4) ◽  
pp. 1-12
Author(s):  
Takayuki Fujino ◽  
Hideo Fujiwara

Sign in / Sign up

Export Citation Format

Share Document