39601037
Nchiql: a Chinese natural language query system to databases
This paper describes Nchiql, a Chinese natural language query system for databases. With a portable query interface to a Chinese database system, it resolves the problems of traditional database query systems and natural language interfaces. We discuss three subsystems in Nchiql: an intelligent user interface; a domain-knowledge extraction system; and a query statement using a natural Chinese language processing system.
2740448
A novel conflict detection and resolution strategy based on TLRSP in replicated mobile database systems
Replication is one of the key technologies in promoting the performance of mobile database systems. In this paper, a novel mobile database replication scheme, the transaction-level result-set propagation (TLRSP) model, is put forward. A conflict detection and resolution strategy based on TLRSP is discussed in detail and its implementation algorithm is proposed. In the TLRSP model, mobile users are allowed to access local replicas of the database and to submit local transactions when the system is disconnected. The locally committed transactions are sent to a fixed database server for conflict reconciliation and result-set incorporation when the system is reconnected. The TLRSP model uses the incremental refreshing method to synchronize database replicas and to maintain the consistency of the replicated mobile database system.
42912843
NChiql: The Chinese Natural Language Interface to Databases
Numerous natural language interface to databases (NLIDBs) developed in the mid-eighties demonstrated impressive characteristic in certain application areas, but NLIDBs did not gained the expected rapid and wide commercial acceptance. We argue that there are two good reasons explain why: limited portability and poor usability. This paper describes the design and implementation of NChiql, a Chinese natural language interface to databases. In order to bright the essence of these problems, we provide an abstract model (AM) in NChiql. We try to give a solution for these problems based on the model in our system. In this paper, we depict a novel method based on database semantics (SCM) to handle the Chinese natural language query, which greatly promotes the system's usability. The experiments show that NChiql has good usability and high correctness.
35913610
Knowledge Discovery Through Self-Organizing Maps: Data Visualization and Query Processing
Abstract. In data mining, the usefulness of a data pattern depends on the user of the database and does not solely depend on the statistical strength of the pattern. Based on the premise that heuristic search in combinatorial spaces built on computer and human cognitive theories is useful for effective knowledge discovery, this study investigates how the use of self-organizing maps as a tool of data visualization in data mining plays a significant role in human–computer interactive knowledge discovery. This article presents the conceptual foundations of the integration of data visualization and query processing for knowledge discovery, and proposes a set of query functions for the validation of self-organizing maps in data mining.
15732177
Network Boosting for BCI Applications
Network Boosting is an ensemble learning method which combines learners together based on a network and can learn the target hypothesis asymptotically. We apply the approach to analyze data from the P300 speller paradigm. The result on the Data set II of BCI (Brain-computer interface) competition III shows that Network Boosting achieves higher classification accuracy than logistic regression, SVM, Bagging and AdaBoost.
4765426
Salient closed boundary extraction with ratio contour
We present ratio contour, a novel graph-based method for extracting salient closed boundaries from noisy images. This method operates on a set of boundary fragments that are produced by edge detection. Boundary extraction identifies a subset of these fragments and connects them sequentially to form a closed boundary with the largest saliency. We encode the Gestalt laws of proximity and continuity in a novel boundary-saliency measure based on the relative gap length and average curvature when connecting fragments to form a closed boundary. This new measure attempts to remove a possible bias toward short boundaries. We present a polynomial-time algorithm for finding the most-salient closed boundary. We also present supplementary preprocessing steps that facilitate the application of ratio contour to real images. We compare ratio contour to two closely related methods for extracting closed boundaries: Elder and Zucker's method based on the shortest-path algorithm and Williams and Thornber's method based on spectral analysis and a strongly-connected-components algorithm. This comparison involves both theoretic analysis and experimental evaluation on both synthesized data and real images.
9669585
Conceptual construction on incomplete survey data
The raw survey data for data mining are often incomplete. The issues of missing data in knowledge discovery are often ignored in data mining. This article presents the conceptual foundations of data mining with incomplete survey data, and proposes query processing for knowledge discovery and a set of query functions for the conceptual construction in survey data mining. Through a case, this paper demonstrates that conceptual construction on incomplete data can be accomplished by using artificial intelligence tools such as self-organizing maps.
123309619
From fragments to salient closed boundaries: an in-depth study
This paper conducts an in-depth study on a classical perceptual-organization problem: finding salient closed boundaries from a set of boundary fragments detected in a noisy image. In this problem, a saliency boundary is formed by identifying and connecting a subset of fragments according to the simple Gestalt laws of closure, continuity, and proximity. Our specific interest is focused on the methods that aim to achieve boundary closure, an important global property of perceptual salient boundaries. In this paper, we analyze and compare three such methods that are developed in recent years: (a) Elder and Zucker's method based on the shortest-path algorithm, (b) Williams and Thornber's method combining the spectral-analysis and the strongly-connected-component algorithms, and (c) Wang, Kubota, and Siskind's method based on ratio-contour algorithm. Both theoretic analysis and experimental study show that, with a unified setting of fragment saliency, Wang, Kubota and Siskind's method more appropriately constrains the search space for the closed boundaries, and usually produces better performance than or at least comparable performance as the other two methods. Particularly, Wang, Kubota, and Siksind's method can always guarantee the boundary closure and simplicity, which may not be always hold in the other two methods. We construct and collect a variety of synthesized and real images for this comparison.