Inheritance rules for flexible model retrieval

Convenient model management requires flexible model retrieval. This paper presents a new flexible retrieval approach for mathematical model bases. The approach defines a multi-valued model inheritance relationship among models at a signature level. The inheritance provides a rich semantic information for the retrieval mechanism to refine inexact retrieval requirements. An inheritance rules reasoning system is proposed to enhance the ability and the efficiency of the model retrieval. The interface of the approach includes an SQL-like command, which enables users to retrieve their required models with inexact requirement expressions. The approach has been implemented in a rule-based mathematical model base system RMMBS. Application examples demonstrate the retrieval approach.     

Constructing Information Bases Using Associative Structures

We present an approach based on knowledge medium using associative structures as a framework of information representation to gather raw information from heterogeneous information sources and to integrate it into information bases cost-effectively.We then present a knowledge media information base system called CM-2 which provides users with a means of accumulating, sharing, exploring and refining conceptually diverse information gathered from vast information sources. We describe the system's four major facilities; (a) an information capture facility, (b) an information integration facility, (c) an information retrieval facility and (d) an information refinement facility. We discuss the strength and weakness of our approach by analyzing results of experiments.     

Motion Retrieval Using Low‐Rank Subspace Decomposition of Motion Volume

This paper proposes a novel framework that allows for a flexible and an efficient retrieval of motion capture data in huge databases. The method first converts an action sequence into a novel representation, i.e. the Self‐Similarity Matrix (SSM), which is based on the notion of self‐similarity. This conversion of the motion sequences into compact and low‐rank subspace representations greatly reduces the spatiotemporal dimensionality of the sequences. The SSMs are then used to construct order‐3 tensors, and we propose a low‐rank decomposition scheme that allows for converting the motion sequence volumes into compact lower dimensional representations, without losing the nonlinear dynamics of the motion manifold. Thus, unlike existing linear dimensionality reduction methods that distort the motion manifold and lose very critical and discriminative components, the proposed method performs well even when inter‐class differences are small or intra‐class differences are large. In addition, the method allows for an efficient retrieval and does not require the time‐alignment of the motion sequences. We evaluate the performance of our retrieval framework on the CMU mocap dataset under two experimental settings, both demonstrating promising retrieval rates.     

Belief rule-base inference methodology using the evidential reasoning Approach-RIMER

In this paper, a generic rule-base inference methodology using the evidential reasoning (RIMER) approach is proposed. Existing knowledge-base structures are first examined, and knowledge representation schemes under uncertainty are then briefly analyzed. Based on this analysis, a new knowledge representation scheme in a rule base is proposed using a belief structure. In this scheme, a rule base is designed with belief degrees embedded in all possible consequents of a rule. Such a rule base is capable of capturing vagueness, incompleteness, and nonlinear causal relationships, while traditional if-then rules can be represented as a special case. Other knowledge representation parameters such as the weights of both attributes and rules are also investigated in the scheme. In an established rule base, an input to an antecedent attribute is transformed into a belief distribution. Subsequently, inference in such a rule base is implemented using the evidential reasoning (ER) approach. The scheme is further extended to inference in hierarchical rule bases. A numerical study is provided to illustrate the potential applications of the proposed methodology.     

Case‐based curve behaviour prediction

Case‐based reasoning (CBR) is the area of artificial intelligence where problems are solved by adapting solutions that worked for similar problems from the past. This technique can be applied in different domains and with different problem representations. In this paper, a system curve base generator (CuBaGe) is presented. This framework is designed to be a domain‐independent prediction system for the analysis and prediction of curves and time‐series trends, based on the CBR technology. CuBaGe employs a novel curve representation method based on splines and a corresponding similarity function based on definite integrals. This combination of curve representation and similarity measure showed excellent results with sparse and non‐equidistant time series, which is demonstrated through a set of experiments. Copyright © 2008 John Wiley & Sons, Ltd.     

The internet-based knowledge acquisition and management method to construct large-scale distributed medical expert systems

The Internet offers an unprecedented opportunity to construct powerful large-scale medical expert systems (MES). In these systems, a cost-effective medical knowledge acquisition (KA) and management scheme is highly desirable to handle the large quantities of, often conflicting, medical information collected from medical experts in different medical fields and from different geographical regions. In this paper, we demonstrate that a medical KA/management system can be built upon a three-tier distributed client/server architecture. The knowledge in the system is stored/managed in three knowledge bases. The maturity of the medical know-how controls the knowledge flow through these knowledge bases. In addition, to facilitate the knowledge representation and application in these knowledge bases as well as information retrieval across the Internet, an 8-digit numeric coding scheme with a weight value system is proposed. At present, a medical KA and management system based on the proposed method is being tested in clinics. Current results have showed that the method is a viable solution to construct, modify, and expand a distributed MES through the Internet.     

融合文本概念化与网络表示的观点检索

观点检索是自然语言处理领域中的一个热点研究课题.现有的观点检索模型在检索过程中往往无法根据上下文将词汇进行知识、概念层面的抽象,在语义层面忽略词汇之间的语义联系,观点层面缺乏观点泛化能力.因此,提出一种融合文本概念化与网络表示的观点检索方法.该方法首先利用知识图谱分别将用户查询和文本概念化到正确的概念空间,并利用网络表示将知识图谱中的词汇节点表示成低维向量,然后根据词向量推出查询和文本的向量并用余弦公式计算用户查询与文本的相关度,接着引入基于统计机器学习的分类方法挖掘文本的观点.最后利用概念空间、网络表示空间以及观点分析结果构建特征,并服务于观点检索模型,相关实验表明,本文提出的检索模型可以有效提高多种检索模型的观点检索性能.其中,基于统一相关模型的观点检索方法在两个实验数据集上相比基准方法在MAP评价指标上分别提升了6.1%和9.3%,基于排序学习的观点检索方法在两个实验数据集上相比于基准方法在MAP评价指标上分别提升了2.3%和14.6%.     

Assessment of four modifications of a novel indexing technique for case‐based reasoning

In this article, we investigate four variations (D‐HS^M, D‐HS^W, D‐HS^E, and D‐HS^EW) of a novel indexing technique called D‐HS designed for use in case‐based reasoning (CBR) systems. All D‐HS modifications are based on a matrix of cases indexed by their discretized attribute values. The main differences between them are in their attribute discretization stratagem and similarity determination metric. D‐HS^M uses a fixed number of intervals and simple intersection as a similarity metric; D‐HS^W uses the same discretization approach and a weighted intersection; D‐HS^E uses information gain to define the intervals and simple intersection as similarity metric; D‐HS^EW is a combination of D‐HS^E and D‐HS^W. Benefits of using D‐HS include ease of case and similarity knowledge maintenance, simplicity, accuracy, and speed in comparison to conventional approaches widely used in CBR. We present results from the analysis of 20 case bases for classification problems and 15 case bases for regression problems. We demonstrate the improvements in accuracy and/or efficiency of each D‐HS modification in comparison to traditional k‐NN, R‐tree, C4,5, and M5 techniques and show it to be a very attractive approach for indexing case bases. We also illuminate potential areas for further improvement of the D‐HS approach. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 353–383, 2007.     

Similarity and metrics in case‐based reasoning

Similarity is a core concept in case‐based reasoning (CBR), because case base building, case retrieval, and even case adaptation all use similarity or similarity‐based reasoning. However, there is some confusion using similarity, similarity measures, and similarity metrics in CBR, in particular in domain‐dependent CBR systems. This article attempts to resolve this confusion by providing a unified framework for similarity, similarity relations, similarity measures, and similarity metrics, and their relationship. This article also extends some of the well‐known results in the theory of relations to similarity metrics. It appears that such extension may be of significance in case base building and case retrieval in CBR, as well as in various applied areas in which similarity plays an important role in system behavior. © 2002 Wiley Periodicals, Inc.     

Efficient rendering of animated characters through optimized per‐joint impostors

In this paper, we present a new impostor‐based representation for 3D animated characters supporting real‐time rendering of thousands of agents. We maximize rendering performance by using a collection of pre‐computed impostors sampled from a discrete set of view directions. Our approach differs from previous work on view‐dependent impostors in that we use per‐joint rather than per‐character impostors. Our characters are animated by applying the joint rotations directly to the impostors, instead of choosing a single impostor for the whole character from a set of pre‐defined poses. This offers more flexibility in terms of animation clips, as our representation supports any arbitrary pose, and thus, the agent behavior is not constrained to a small collection of pre‐defined clips. Because our impostors are intended to be valid for any pose, a key issue is to define a proper boundary for each impostor to minimize image artifacts while animating the agents. We pose this problem as a variational optimization problem and provide an efficient algorithm for computing a discrete solution as a pre‐process. To the best of our knowledge, this is the first time a crowd rendering algorithm encompassing image‐based performance, small graphics processing unit footprint, and animation independence is proposed. Copyright © 2012 John Wiley & Sons, Ltd.     

Spatial reasoning and similarity retrieval for image database systems based on RS-strings

In this paper, we propose a rotation-invariant spatial knowledge representation called RS-string. Then we present the string generation algorithm to automatically generate RS-strings for segmented pictures. We also propose the spatial reasoning and similarity retrieval algorithms based on RS-strings. The similarity retrieval algorithm is much more flexible than all previous 2D string representations because our approach can consider every possible view of a query picture. Thus the system does not require the user to provide a query picture which must have the same orientation as that of a database picture. Finally, we provide several examples to demonstrate the capabilities of spatial reasoning and similarity retrieval based on the RS-string representation.     

Assessing similarity models for human‐motion retrieval applications

The development of motion capturing devices poses new challenges in the exploitation of human‐motion data for various application fields, such as computer animation, visual surveillance, sports, or physical medicine. Recently, a number of approaches dealing with motion data have been proposed, suggesting characteristic motion features to be extracted and compared on the basis of similarity. Unfortunately, almost each approach defines its own set of motion features and comparison methods; thus, it is hard to fairly decide which similarity model is the most suitable for a given kind of human‐motion retrieval application. To cope with this problem, we propose the human motion model evaluator, which is a generic framework for assessing candidate similarity models with respect to the purpose of the target application. The application purpose is specified by a user in form of a representative sample of categorized motion data. Respecting such categorization, the similarity models are assessed from the effectiveness and efficiency points of view using a set of space‐complexity, information‐retrieval, and performance measures. The usability of the framework is demonstrated by case studies of three practical examples of retrieval applications focusing on recognition of actions, detection of similar events, and identification of subjects. Copyright © 2015 John Wiley & Sons, Ltd.     

一种改进的本体语义相似度计算及其应用

词语相似度研究,是知识表示以及信息检索领域中的一个重要内容.词语相似度的计算方法一般是利用大规模的语料库来统计.本体给词语间相似度计算带来了新的机会.利用本体结构上的ISA关系,提出了本体内部概念之间的相似度计算方法.实验结果表明,该方法能充分利用本体特点来计算相关概念之间的相似度.结合一个简单本体,介绍了如何计算概念间的相似度,及其在智能检索系统中的应用.     

An evolutionary‐based adaptive neuro‐fuzzy inference system for intelligent short‐term load forecasting

The continuing growth in size and complexity of electric power systems requires the development of applicable load forecasting models to estimate the future electrical energy demands accurately. This paper presents a novel load forecasting approach called genetic‐based adaptive neuro‐fuzzy inference system (GBANFIS) to construct short‐term load forecasting expert systems and controllers. At the first stage, all records of data are searched by a novel genetic algorithm (GA) to find the most suitable feature of inputs to construct the model. Then, determined inputs are fed into the adaptive neuro‐fuzzy inference system to evolve the initial knowledge‐base of the expert system. Finally, the initial knowledge‐base is searched by another robust GA to induce a better cooperation among the rules by rule weight derivation and rule selection mechanisms. We show the superiority and applicability of our approach by applying it to the Iranian monthly electrical energy demand problem and comparing it with the most frequently adopted approaches in this field. Results indicate that GBANFIS outperforms its rival approaches and is a promising tool for dealing with short‐term load forecasting problems.     

Medical image retrieval based on unclean image bags

Traditional content-based image retrieval (CBIR) scheme with assumption of independent individual images in large-scale collections suffers from poor retrieval performance. In medical applications, images usually exist in the form of image bags and each bag includes multiple relevant images of the same perceptual meaning. In this paper, based on these natural image bags, we explore a new scheme to improve the performance of medical image retrieval. It is feasible and efficient to search the bag-based medical image collection by providing a query bag. However, there is a critical problem of noisy images which may present in image bags and severely affect the retrieval performance. A new three-stage solution is proposed to perform the retrieval and handle the noisy images. In stage 1, in order to alleviate the influence of noisy images, we associate each image in the image bags with a relevance degree. In stage 2, a novel similarity aggregation method is proposed to incorporate image relevance and feature importance into the similarity computation process. In stage 3, we obtain the final image relevance in an adaptive way which can consider both image bag similarity and individual image similarity. The experiments demonstrate that the proposed approach can improve the image retrieval performance significantly.     

Database‐Assisted Object Retrieval for Real‐Time 3D Reconstruction

In recent years, real‐time 3D scanning technology has developed significantly and is now able to capture large environments with considerable accuracy. Unfortunately, the reconstructed geometry still suffers from incompleteness, due to occlusions and lack of view coverage, resulting in unsatisfactory reconstructions. In order to overcome these fundamental physical limitations, we present a novel reconstruction approach based on retrieving objects from a 3D shape database while scanning an environment in real‐time. With this approach, we are able to replace scanned RGB‐D data with complete, hand‐modeled objects from shape databases. We align and scale retrieved models to the input data to obtain a high‐quality virtual representation of the real‐world environment that is quite faithful to the original geometry. In contrast to previous methods, we are able to retrieve objects in cluttered and noisy scenes even when the database contains only similar models, but no exact matches. In addition, we put a strong focus on object retrieval in an interactive scanning context — our algorithm runs directly on 3D scanning data structures, and is able to query databases of thousands of models in an online fashion during scanning.     

QoRank: A query‐dependent ranking model using LSE‐based weighted multiple hyperplanes aggregation for information retrieval

Ranking is a core problem for information retrieval since the performance of the search system is directly impacted by the accuracy of ranking results. Ranking model construction has been the focus of both the fields of information retrieval and machine learning, and learning to rank in particular has attracted much interest. Many ranking models have been proposed, for example, RankSVM is a state‐of‐the‐art method for learning to rank and has been empirically demonstrated to be effective. However, most of the proposed methods do not consider about the significant differences between queries, only resort to a single function in ranking. In this paper, we present a novel ranking model named QoRank, which performs the learning task dependent on queries. We also propose a LSE (least‐squares estimation) ‐based weighted method to aggregate the ranking lists produced by base decision functions as the final ranking. Comparison of QoRank with other ranking techniques is conducted, and several evaluation criteria are employed to evaluate its performance. Experimental results on the LETOR OHSUMED data set show that QoRank strikes a good balance of accuracy and complexity, and outperforms the baseline methods. © 2010 Wiley Periodicals, Inc.     

Web 2.0下基于案例的知识管理系统

为实现Web 2.0环境下网络知识的获取和共享,提出一种基于案例的知识管理系统。采用案例推理的方法实现知识管理,根据Web 2.0网络环境的特点,在案例表达阶段,为每个案例设置标签属性,使其能实现开放性分类。在案例检索阶段,将领域本体引入相似度的计算。利用人工神经网络算法、用户录入案例标签维护案例库和本体库。实验结果表明,该系统能快速检索出具有较高相似度的历史案例。     

HEARTDROID—Rule engine for mobile and context‐aware expert systems

Building mobile context‐aware systems is inherently complex and non‐trivial task. It consists of several phases starting from acquisition of context, through modeling to execution of contextual models. Today, such systems are mostly implemented on mobile platforms, that introduce specific requirements, such as intelligibility, robustness, privacy, and efficiency. Over the last decade, along with the rapid development of mobile industry, many approaches were developed that unevenly support these requirements. This is mainly caused by the fact that current modelling and reasoning methods are not crafted to operate in mobile environments. We argue that the use of rule‐based reasoning tailored to mobile environments is an optimal solution. Rules are based on symbolic knowledge representation, as such they meet the general tendency to enforce understandability, intelligibility, and controllability of artificial intelligence software, as stated in the recent European Union General Data Protection Regulation. To this goal, we introduce a lightweight rule engine dedicated for Android platform called HEARTDROID. It executes models in the HMR+ rule language that are capable of expressing uncertainty of knowledge, capturing dynamics of mobile environment and provide high level of intelligibility. We present a qualitative and quantitative comparison of HEARTDROID with the most popular rule engines available.