28737704
Feature-Correlation Based Multi-view Detection
A view validation algorithm has been shown to predict whether or not the views are sufficiently compatible for solving a particular learning task. But it only works when a natural split of features exists. If the split does not exist, it will fail to manufacture a feature split to build the best views. In this paper, we present a general algorithm CCFP (Correlation and Compatibility based Feature Partitioner) to automate multi-view detection. CCFP first labels the large amount of unlabeled examples using single view algorithm, then calculates the conditional SU (Symmetric Uncertainty) between every pair of features and the IG (Information Gain) of each feature given the examples labeled previously by single view algorithm with high-confidence predictions. According to the estimated values of SU and IG, all the features will be partitioned into two views that are low correlated, compatible and sufficient enough. The experiment results show that multi-view learner with views generated by CCFP outperforms learner with views generated by other means clearly.
4342705
Weighted Ontology-Based Search Exploiting Semantic Similarity
This paper is concerned with the problem of semantic search. By semantic search, we mean searching for instances from knowledge base. Given a query, we are to retrieve ‘relevant’ instances, including those that contain the query keywords and those that do not contain the keywords. This is contrast to the traditional approaches of generating a ranked list of documents that contain the keywords. Specifically, we first employ keyword based search method to retrieve instances for a query; then a proposed method of semantic feedback is performed to refine the search results; and then we conduct re-retrieval by making use of relations and instance similarities. To make the search more effective, we use weighted ontology as the underlying data model in which importances are assigned to different concepts and relations. As far as we know, exploiting instance similarities in search on weighted ontology has not been investigated previously. For the task of instance similarity calculation, we exploit both concept hierarchy and properties. We applied our methods to a software domain. Empirical evaluation indicates that the proposed methods can improve the search performance significantly.
17724018
Logical structure based semantic relationship extraction from semi-structured documents
Addressed in this paper is the issue of semantic relationship extraction from semi-structured documents. Many research efforts have been made so far on the semantic information extraction. However, much of the previous work focuses on detecting `isolated' semantic information by making use of linguistic analysis or linkage information in web pages and limited research has been done on extracting semantic relationship from the semi-structured documents. In this paper, we propose a method for semantic relationship extraction by using the logical information in the semi-structured document (semi-structured document usually has various types of structure information, e.g. a semi-structured document may be hierarchical laid out). To the best of our knowledge, extracting semantic relationships by using logical information has not been investigated previously. A probabilistic approach has been proposed in the paper. Features used in the probabilistic model have been defined.
18105952
Adapting Prime Number Labeling Scheme for Directed Acyclic Graphs
Directed Acyclic Graph(DAG) could be used for modeling subsumption hierarchies. Several labeling schemes have been proposed or tailored for indexing DAG in order to efficiently explore relationships in such hierarchy. However few of them can satisfy all the requirements in response time, space, and effect of updates simultaneously. In this paper, the prime number labeling scheme is extended for DAG. The scheme invests intrinsic mapping between integer divisibility and subsumption hierarchy, which simplifies the transitive closure computations and diminishes storage redundancy, as well as inherits the dynamic labeling ability from original scheme. Performance is further improved by introducing some optimization techniques. Our extensive experimental results show that prime number labeling scheme for DAG outperforms interval-based and prefix-based labeling schemes in most cases.
26966022
Term Committee Based Event Identification within News Topics
Most previous research focus on organizing news set into flat collections of stories. However, a topic in news is more than a mere collection of stories: it is characterized by a definite structure of inter-related events. Stories within a topic usually share some terms which are related to the topic other than a specific event, so stories of different events are usually very similar to each other within a topic. To deal with this problem, we propose a new event identification method based on the term committee. We first capture some tight term clusters as term committees of potential events, and then use them to reweight the key terms in a story. The experimental results on two Linguistic Data Consortium (LDC) datasets show that the proposed method for event identification outperforms previous methods significantly.
18767470
New event detection based on indexing-tree and named entity
New Event Detection (NED) aims at detecting from one or multiple streams of news stories that which one is reported on a new event (i.e. not reported previously). With the overwhelming volume of news available today, there is an increasing need for a NED system which is able to detect new events more efficiently and accurately. In this paper we propose a new NED model to speed up the NED task by using news indexing-tree dynamically. Moreover, based on the observation that terms of different types have different effects for NED task, two term reweighting approaches are proposed to improve NED accuracy. In the first approach, we propose to adjust term weights dynamically based on previous story clusters and in the second approach, we propose to employ statistics on training data to learn the named entity reweighting model for each class of stories. Experimental results on two Linguistic Data Consortium (LDC) datasets TDT2 and TDT3 show that the proposed model can improve both efficiency and accuracy of NED task significantly, compared to the baseline system and other existing systems.
2688754
A method for evaluating upper bound of simultaneous switching gates using circuit partition
This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into subcircuits, and the upper bound is approximately computed as the sum of maximum switching gates for all subcircuits. In order to increase the accuracy, we adopted an evaluation function that takes account of both the interconnections among subcircuits and the number of generated subcircuits. Experimental results for ISCAS circuits show that the method efficiently evaluates the upper bounds of switching gates.
14385690
A New Least Squares Subspace Projection Approach to Unmix Hyperspectral Data
Linearly constrained discriminant analysis (LCDA) and orthogonal subspace projection (OSP) are both explored in hyperspectral image classification and have shown promise in signature detection, discrimination and classification. However, the two subspace projection approaches cannot directly estimate the signature abundance. The OSP has been extended by a least squares orthogonal subspace projection (LSOSP) to estimate the signature abundance while LCDA has not. The solution of LCDA turns out to be a constrained version of OSP implemented with a data whitening process and the means of samples as signatures. Due to this fact, following the same idea for extending OSP to LSOSP, in this paper, a modified linearly constrained discriminant analysis (MLCDA) is proposed for unmixing hyperspectral data, which can directly estimate the signature abundance. Experiment results obtained from both artificial simulated and practical remote sensing data demonstrate that the MLCDA algorithm performs better than least squares method and the LSOSP.
5848822
Soft decoder architecture of LT codes
Luby transform (LT) codes, as the first class of efficient rateless codes, attract a lot of attention in the coding theory field. However, the VLSI implementation of LT codes is challenging due to its random code construction characteristic as well as the flexible output length. In this paper, we present an applicable architecture of a soft-decision LT decoder with a block length of 1024 bits and 100 iterations. Partly parallel input node processing and output node processing techniques are both adopted to accelerate decoding speed. An efficient router and reverse router are designed to indicate the graphic connectivity between input nodes and output nodes. The parallel architecture is prototyped on the target FPGA device.
11423295
Multi-view face identification and pose estimation using B-spline interpolation
The available face views in the training set are mostly limited. In this paper, we present a view interpolation method using nonlinear B-spline on face manifolds. Two models, the inner-outer ellipse model and the moment of inertia model, are developed to estimate the pose orientation. We use the limited view-pose face images to form the pose eigen space. Then, based on these nonlinear manifolds we form a B-spline for each individual. Identification is to compute the shortest Euclidean distance from a given test view to the nearest point within one of these B-splines. Once the test view is classified as a familiar individual in the training set, not only can the individual be identified, but also the pose angle can be estimated. Experimental results show that B-spline interpolation can achieve a recognition rate of 95%.
31414473
Improved Learning Algorithm Based on Generalized SOM for Dynamic Non-linear System
This paper proposes an improved learning algorithm based on generalized SOM for dynamical non-linear system identification. To improve the convergent speed and the accuracy of SOM algorithm, we propose the improved self-organizing algorithm, which, at first, applies the multiple local models instead of the global model, and secondly, adjusts the weights of the computing output layers along with the weights of the competing neurons layer during the training process. We prove that the improved algorithm is convergent if the network has suitable initial weights and small positive real parameters. The simulation results using our improved generalized SOM show an improvement for non-linear system compared to traditional neural network control systems.