Search problems generally fall into the class of NP-hard problems. Many real problems including planning, diagnosing, allocation tasks, classification tasks and scenario-making, require examination of large search spaces. These problems canno: be solved directly (i.e., without searching) by simply applying the appropriate algorithms. Expert systems are usually applied to solve diyerent search p...

Current search engines generally employ link analysis techniques to web-page re-ranking. However, the same techniques are problematic in small webs, such as websites or intranet webs, because the link structure is different from the global Web. We propose a re-ranking mechanism based on implicit links generated from user access patterns. Experimental results indicate that our method outperforms...

This paper invents symbolic pattern databases (SPDB) to combine two influencing aspects for recent progress in domain-independent action planning, namely heuristic search and model checking. SPDBs are off-line computed dictionaries, generated in symbolic backward traversals of automatically inferred planning space abstractions. The entries of SPDBs serve as heuristic estimates to accelerate exp...

abstract Pattern-weight pairs (pws) are a new form of search and planning knowledge. Pws are predicates over states coupled with a least upper bound on the distance from any state satisfying that predicate to any goal state. The relationship of pws to more traditional forms of search knowledge is explored with emphasis on macros and subgoals. It is shown how pws may be used to overcome some of ...

For many applications such as accounting, banking, business transaction processing systems, geographical information systems, medical record book keeping, etc., the changes made on their databases over time are a valuable source of information which can direct the future operation of the enterprise. In this thesis, we will focus on relational databases with historical data or, in other words, t...

The paper presents the results of an analysis of the merits and problems of using suffix arrays as an index data structure for annotated natural-language corpora. It shows how multiple suffix arrays can be combined to represent layers of annotation, and how this enables matches for complex linguistic patterns to be identified in the corpus quickly and, for a large subclass of patterns, with gre...

ML4PG is an extension of the Proof General interface of Coq, allowing the user to invoke machine-learning algorithms and find proof similarities in Coq/SSReflect libraries. In this talk, we will show the recent ML4PG features in action, using examples from the standard SSReflect library and HoTT library. We will compare ML4PG with traditional Coq searching tools and dependency graphs.

The existing studies are mostly focused on the multiple graphs scenario. With some modifications, the mining methodology can be extended to the single graph scenario [30]. Washio and Motoda [56] conducted a survey on graph-based data mining. Holder et al. [21] proposed SUBDUE to do subgraph pattern discovery based on minimum description length and background knowledge. The most popular graph pa...

The nature of co-operating Uninhabited Vehicle (UV) systems is such that performance enhancements are likely to be a result of greatly increased system complexity. This complexity emerges through the interaction of multiple autonomous UVs, and hence presents a fundamental challenge in the effective deployment of UV systems. Because of the very nature of the advantage of these systems, they are ...

In this paper we propose refinements for optimal search with symbolic pattern databases in deterministic statespace planning. As main memory is limited, external heuristic search is combined with the power of symbolic representation. We start with an external version of symbolic breadth-first search. Then an alternative and external implementation for BDDA* to include different heuristic evalua...