We review lexical Association Measures (AMs) that have been employed by past work in extracting multiword expressions. Our work contributes to the understanding of these AMs by categorizing them into two groups and su...
详细信息
Handling full permutations of the candidate list along with re-encryption mixes is rather difficult in Prêt à Voter but handling cyclic shifts is straightforward. One of the versions of Prêt à Vote...
详细信息
Uncertain and incomplete requirements throughout the whole software life cycle contribute to volatility of the requirements. In a situation where the volatile requirement is changed to satisfy stakeholder needs, all t...
详细信息
ISBN:
(纸本)9780769539096
Uncertain and incomplete requirements throughout the whole software life cycle contribute to volatility of the requirements. In a situation where the volatile requirement is changed to satisfy stakeholder needs, all the affected requirements and other impacted software artefacts (such as designs, codes, and tests) must be identified and changed accordingly. This paper introduces an approach to facilitate both engineers and users in propagating changes from requirements to the software high-level designs during software development and evolution. The two main pillars of this approach, namely product metamodel and process model are described in details. Firstly, the metamodel highlights on explicit conceptual model for volatile requirement and its characteristics. Next, the focus will be placed on the systematic process model specified using the SPEM that offers guidelines to perform the requirement change process. The applicability of the product metamodel and its elements are evaluated using the IFAMMS case study application.
Generalization of web sessions is an effective approach used to overcome two major challenges in web usage mining, namely quality and scalability. Given a concept hierarchy, such as a website, generalization replaces ...
详细信息
ISBN:
(纸本)9781605588087
Generalization of web sessions is an effective approach used to overcome two major challenges in web usage mining, namely quality and scalability. Given a concept hierarchy, such as a website, generalization replaces actual page-clicks with their general concepts, i.e., nodes at higher levels. Presently known methods do this by choosing a level in the hierarchy, below which all the nodes are generalized to nodes at this level. The problem with this is that significant items may be coalesced, and insignificant ones may be retained. We present a usage driven generalization algorithm, which coalesces less significant pages into more general ones, independent of their level in the hierarchy. Based on actual usage set of sessions, item significance is estimated approximately but fast, using a small stratified sample of the large dataset. While providing scalability, the proposed generalization technique results in improved efficiency and quality of the discovered usage model, demonstrated through numerous experiments in our work. Copyright 2009 ACM.
Numerous logic frameworks have been proposed for modeling uncertainty and reasoning with such data. While different in syntax, the approaches of these frameworks have been classified into "annotation based" ...
详细信息
ISBN:
(纸本)9781577354192
Numerous logic frameworks have been proposed for modeling uncertainty and reasoning with such data. While different in syntax, the approaches of these frameworks have been classified into "annotation based" (AB) and "implication based" (IB). In this paper, we present a unified framework which allows evaluating programs in either approach. It extends existing query processing techniques to handle certainty constraints and uses heuristics to further improve the performance. Our experiments indicate that the proposed techniques yield useful tools for uncertainty reasoning.
Rewriting of conjunctive queries using views has many applications in database and data *** investigate ways to improve performance of rewriting and propose a new algorithm which has two phases. In the first phase, si...
详细信息
Rewriting of conjunctive queries using views has many applications in database and data *** investigate ways to improve performance of rewriting and propose a new algorithm which has two phases. In the first phase, similar to Minicon, we find mapping information, which we call coverages, from subgoals in the query to subgoals in view, and assign positive integers (n) as identifiers to these coverages, where n is the number of subgoals in the query. In the rewriting phase, based on the available identifiers and partitions of the set -1, ., 2n-1}, we define patterns and use them to encode the buckets and the coverages they contain. This breaks the cartesian product of a set of large buckets into several cartesian products on sets of smaller buckets. In other words, an expensive cartesian product could be broken into a maximum of B(n) small cartesian products, where B is the Bell number. Our numerous experiments using different query types and sizes indicate significant time and space improvement for computing the cartesian products of the buckets and generating the output.
This paper describes an approach to improving the robustness of an agent system by augmenting its failure-handling capabilities. The approach is based on the concept of semantic compensation: "cleaning up" f...
详细信息
Current web search engines return query-biased snippets for each document they list in a result set. For efficiency, search engines operating on large collections need to cache snippets for common queries, and to cach...
详细信息
The k-anonymity technique is widely used to provide location privacy protection for accessing location-based services (LBS), i.e., the exact location of a query initiator is cloaked into a spatial region that contains...
详细信息
暂无评论