Given the vastness of Internet, search engines have to find not only relevant but also high-quality web pages to satisfy users' information need. At present, most quality assessing methods for web pages are based ...
详细信息
The study on pattern classification trends to be towards large-scale, multi-label, and imbalanced problems. The amount of the data which need to be classified is typically dozens of millions and it keeps rapid increas...
详细信息
ISBN:
(纸本)9781467314886
The study on pattern classification trends to be towards large-scale, multi-label, and imbalanced problems. The amount of the data which need to be classified is typically dozens of millions and it keeps rapid increasing in recent years. Traditional pattern classification approaches are inefficient and even ineffective in this situation. In our previous work, we proposed a min-max modular (M~3) network for dealing with large-scale and imbalanced problems. M~3-network is a generalized modular learning framework and includes three main steps: decomposing a large-scale problem into several smaller independent sub-problems, learning these sub-problems in parallel, and combining the results of the sub-problems to generate a solution to the original problem. In this paper, we embed LIBLINEAR into M~3-network (M3-liblnear) to deal with large-scale, multi-label, and imbanlanced pattern classification problems. LIBLINEAR is a fast implementation of a linear classifier. M~3-Liblinear uses LIBLINEAR as a base classifier to learn each of the sub-problems. We compare M~3-Liblinear with Liblinear-cdblock on a large-scale Japanese patent classification problem. Experimental results demonstrate that M~3-Liblinear is superior to Liblinearcd-block in both training time and generalization performance.
The existing query languages for XML (e.g., XQuery) require professional programming skills to be formulated, however, such complex query languages burden the query processing. In addition, when issuing an XML query, ...
详细信息
ISBN:
(纸本)9781467300421
The existing query languages for XML (e.g., XQuery) require professional programming skills to be formulated, however, such complex query languages burden the query processing. In addition, when issuing an XML query, users are required to be familiar with the content (including the structural and textual information) of the hierarchical XML, which is diffcult for common users. The need for designing user friendly interfaces to reduce the burden of query formulation is fundamental to the spreading of XML community. We present a twig-based XML graphical search system, called LotusX, that provides a graphical interface to simplify the query processing without the need of learning query language and data schemas and the knowledge of the content of the XML document. The basic idea is that LotusX proposes "position-aware" and "auto-completion" features to help users to create tree-modeled queries (twig pattern) by providing the possible candidates on-the-fly. In addition, complex twig queries (including order sensitive queries) are supported in LotusX. Furthermore, a new ranking strategy and a query rewriting solution are implemented to rank and rewrite the query effectively. We provide an online demo for LotusX system: http://***:8080/LotusX.
In this paper, we investigate backward stochastic differential equations (BSDEs) driven by Brownian motion. We propose a class of Euler type numerical methods with one parameter based on random walk framework for one-...
In this paper, we investigate backward stochastic differential equations (BSDEs) driven by Brownian motion. We propose a class of Euler type numerical methods with one parameter based on random walk framework for one-dimensional Brownian motion. The convergence of such schemes is proved.
We in this paper present the model for our participation (BCMI) in the CoNLL-2012 Shared Task. This paper describes a pure rule-based method, which assembles different filters in a proper order. Different filters hand...
详细信息
ISBN:
(纸本)9781627484046
We in this paper present the model for our participation (BCMI) in the CoNLL-2012 Shared Task. This paper describes a pure rule-based method, which assembles different filters in a proper order. Different filters handle different situations and the filtering strategies are designed manually. These filters are assigned to different ordered tiers from general to special cases. We participated in the Chinese and English closed tracks, scored 51.83 and 59.24 respectively.
This paper describes our coreference resolution system for the CoNLL-2012 shared task. Our system is based on the Stanford's dcore-f deterministic system which applies multiple sieves with the order from high prec...
详细信息
ISBN:
(纸本)9781627484046
This paper describes our coreference resolution system for the CoNLL-2012 shared task. Our system is based on the Stanford's dcore-f deterministic system which applies multiple sieves with the order from high precision to low precision to generate coreference chains. We introduce the newly added constraints and sieves and discuss the improvement on the o-riginal system. We evaluate the system using OntoNotes data set and report our results of average F-score 58.25 in the closed track.
Join processing in wireless sensor networks is a challenging problem. Current solutions are not involved in the join operation among tuples of the latest sampling periods. In this article, we proposed a continuous Sin...
详细信息
Join processing in wireless sensor networks is a challenging problem. Current solutions are not involved in the join operation among tuples of the latest sampling periods. In this article, we proposed a continuous Single attribute Join Queries within latest sampling Periods (SJQP) for wireless sensor networks. The main idea of our filter-based framework is to discard non-matching tuples, and our scheme can guarantee the result is correct independent of the filters. Experiments based on real-world sensor data show that our method performs close to a theoretical optimum and consistently outperforms the centralized join algorithm.
Internet of Things (IoT) or Cyber-Physical Systems (CPS) is a new trend of real-time systems in the area of information technology. This paper introduces a spatiotemporal consistence language for real-time systems (Sh...
详细信息
Internet of Things (IoT) or Cyber-Physical Systems (CPS) is a new trend of real-time systems in the area of information technology. This paper introduces a spatiotemporal consistence language for real-time systems (Shortly, STeC). The consistence requires that a process do its tasks at the required location or time. Thus, this language provides a location-triggered specification for real-time systems. The interaction between real-time agents deals with agent2agent communications. STeC looks like an extension of precess algebra CSP. But, the execution-time of actions and status of agents are stressed. Two kinds of interrupts time and interaction break are considered. Following the Dijkstra's guard style, nondeterministic choice phase guarded by communications is introduced. After setting up the syntax, its operational semantics is introduced. As an example, the railroad crossing problem is specified in terms of this language STeC.
In this study, we investigate the break index labeling problem with a syntactic-to-prosodic structure conversion. The statistical relationship between the mapped syntactic tree structure and prosodic tree structure of...
详细信息
In this study, we investigate the break index labeling problem with a syntactic-to-prosodic structure conversion. The statistical relationship between the mapped syntactic tree structure and prosodic tree structure of sentences in the training set is used to generate a Synchronous Tree Substitution Grammar (STSG) which can describe the probabilistic mapping (substitution) rules between them. For a given test sentence and the corresponding parsed syntactic tree structure, thus generated STSG can convert the syntactic tree to a prosodic tree statistically. We compare the labeling results with other approaches and show the probabilistic mapping can indeed benefit break index labeling performance.
暂无评论