检索结果-内蒙古大学图书馆

Federated Conference on computer science and Information Systems (FedCSIS)

作者： Farag Ahmed Andreas Nürnberger Data & Knowledge Engineering Group Faculty of Computer Science Otto-von-Guericke University of Magdeburg Germany

We present a language independent approach for conflation that does not depend on predefined rules or prior knowledge of the target language. The proposed unsupervised method is based on an enhancement of the pure n-gram model that is used to group related words based on a revised string-similarity measure. In order to detect and eliminate terms that are created by this process, but that are most likely not relevant for the query (”noisy terms”), an approach based on mutual information scores computed based on web statistical cooccurrences data is proposed. Furthermore, an evaluation of this approach is presented.

关键词： Mutual information Computational modeling Noise measurement Dictionaries Morphology computer science

来源：评论

学校读者我要写书评

暂无评论

RESP: A computer Aided OWL REasoner Selection Process

RESP: A Computer Aided OWL REasoner Selection Process

引用

International Conference on Semantic Computing

作者： Wei Tai John Keeney Declan O'Sullivan Knowledge and Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Dublin Ireland

Existing approaches for selecting the most appropriate reasoner for different semantic applications mainly relies on discussions between application developers and reasoner experts. However this approach will become inadequate with the increasing adoption of Semantic Web technologies in applications from different domains and the rapid development of OWL reasoning technologies. This work proposes RESP, a computer aided reasoner selection process designed to perform reasoner selection for different applications and so reduce the effort and communication overhead required to select the most appropriate reasoner. Preliminary evaluation results show that RESP successfully helps application developers to select the most appropriate reasoner, or at least narrow down the number of candidate reasoners to consider. Contributions of this work are two folds: (1) the design of a (relatively simple but useful) computer aided OWL reasoner selection process, and (2) the identification and discussion of a set of example application characteristics that can affect the OWL reasoner selection.

关键词： OWL Cognition Ontologies Semantics Algorithm design and analysis Bioinformatics Concrete

来源：评论

学校读者我要写书评

暂无评论

Explicit federal relationship management to support semantic integration

Explicit federal relationship management to support semantic...

引用

IFIP/IEEE International Symposium on Integrated Network Management

作者： Rob Brennan Kevin Feeney Brian Walsh Hendrik Thomas Declan O'Sullivan FAME and Knowledge and Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Dublin Ireland

ISBN: (纸本)9781424492190

Integration of disparate information resources has long been a significant research topic. Semantic approaches can help by allowing expression of concepts divorced from syntax and allowing rich, structured meta-data to be published in a form that is amenable to machine processing, reasoning and inter-domain concept mapping. However the creation of mappings, especially in a dynamic federations of autonomous entities, is time-consuming and vulnerable to brittleness and high maintenance costs due to change at many levels in the system. In this paper we propose an approach to managing change and maximizing mapping reuse by building explicit models of the federal relationship context of mapping deployment. These descriptions enable automated support for mapping reuse suggestions and ease discovery of relevant mappings due to changes at the federation, peer domain, shared capability or local model levels.

关键词： Semantics Resource description framework OWL Logic gates Context Packaging

来源：评论

学校读者我要写书评

暂无评论

A practice probability frequent pattern mining method over transactional uncertain data streams

A practice probability frequent pattern mining method over t...

引用

Lecture Notes in computer science

作者： Liao, Guoqiong Wu, Linqing Wan, Changxuan Xiong, Naixue School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China Department of Computer Science Georgia State University United States

ISBN: (纸本)9783642236402

In recent years, large amounts of uncertain data are emerged with the widespread employment of the new technologies, such as wireless sensor networks, RFID and privacy protection. According to the features of the uncertain data streams such as incomplete, full of noisy, non-uniform and mutable, this paper presents a probability frequent pattern tree called PFP-tree and a method called PFP-growth, to mine probability frequent patterns based on probability damped windows. The main characteristics of the suggested method include: (1) adopting time-based probability damped window model to enhance the accuracy of mined frequent patterns;(2) setting an item index table and a transaction index table to speed up retrieval on the PFP-tree;and (3) pruning the tree to remove the items that cannot become frequent patterns;. The experimental results demonstrate that PFP-growth method has better performance than the main existing schemes in terms of accuracy, processing time and storage space. © 2011 Springer-Verlag.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

High-dimensional Gaussian graphical model selection: walk summability and local separation criterion

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2012年第1期13卷

作者： Animashree Anandkumar Vincent Y. F. Tan Furong Huang Alan S. Willsky Electrical Engineering and Computer Science University of California Irvine Irvine CA Data Mining Department Institute for Infocomm Research Singapore Electrical and Computer Engineering National University of Singapore Stochastic Systems Group Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA

We consider the problem of high-dimensional Gaussian graphical model selection. We identify a set of graphs for which an efficient estimation algorithm exists, and this algorithm is based on thresholding of empirical conditional covariances. Under a set of transparent conditions, we establish structural consistency (or sparsistency) for the proposed algorithm, when the number of samples n = Ω(Jmin-2 log p), where p is the number of variables and Jmin is the minimum (absolute) edge potential of the graphical model. The sufficient conditions for sparsistency are based on the notion of walk-summability of the model and the presence of sparse local vertex separators in the underlying graph. We also derive novel non-asymptotic necessary conditions on the number of samples required for sparsistency.

关键词： Gaussian graphical model selection high-dimensional learning local-separation property necessary conditions for model selection walk-summability

来源：评论

学校读者我要写书评

暂无评论

A trust model for capability delegation in federated policy systems

A trust model for capability delegation in federated policy ...

引用

International Conference on Risks and Security of Internet and Systems, CRiSIS

作者： Kevin Feeney Simon N. Foley Rob Brennan FAME and Knowledge & Data Engineering Group Intelligent Systems Laboratory Trinity College Dublin Ireland FAME and Department of Computer Science University College Cork Cork Ireland

Federated policy systems are required to support the emergent complexity and organizational heterogeneity of modern Internet service delivery. This paper presents a distributed policy management approach which utilizes a flexible, tree-based capability authority model to partition and delegate federated capabilities or services. A trust management model and a delegation logic is defined which supports secure decentralized policy reasoning and addresses performance overheads due to distributed rule evaluation, threats from malformed or malicious federated principals and allows flexibility with respect to delegation chain reduction or capability authority re-partitioning. The system is evaluated through a security analysis and a prototype implementation of a federated policy engineering framework based on this logic is described. This framework is based on public key certificates and an extension to the Keynote Trust Management language. It provides practical management services such as key discovery and certificate revocation in addition to the core capability delegation function.

关键词： Information services Public key Internet Semantics Authorization Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Approaches to Relating and Integrating Semantic data from Heterogeneous Sources

Approaches to Relating and Integrating Semantic Data from He...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： John Keeney Aidan Boran Ivan Bedini Christopher J. Matheus Peter F. Patel-Schneider Knowledge & Data Engineering Group & FAME Computer Science & Statistics Trinity College Dublin Ireland Bell Laboratories Alcatel-Lucent Dublin Ireland

Integrating and relating heterogeneous data using inference is one of the cornerstones of semantic technologies and there are a variety of ways in which this may be achieved. Cross source relationships can be automatically translated or inferred using the axioms of RDFS/OWL, via user generated rules, or as the result of SPARQL query result transformations. For a given problem it is not always obvious which approach (or combination of approaches) will be the most effective and few guidelines exist for making this choice. This paper discusses these three approaches and demonstrates them using an "acquaintance" relationship drawn from data residing in common RDF information sources such as FOAF and DBLP data stores. The implementation of each approach is described along with practical considerations for their use. Quantitative and qualitative evaluation results of each approach are presented and the paper concludes with initial suggestions for guiding principles to help in selecting an appropriate approach for integrating heterogeneous semantic data sources.

关键词： Semantics OWL Resource description framework Cognition Ontologies Engines Distributed databases

来源：评论

学校读者我要写书评

暂无评论

Modeling Location-Based Profiles of Social Image Media Using Explorative Pattern Mining

Modeling Location-Based Profiles of Social Image Media Using...

引用

IEEE International Conference on and IEEE International Confernece on Social Computing (SocialCom) Privacy, Security, Risk and Trust (PASSAT)

作者： Florian Lemmerich Martin Atzmueller Artificial Intelligence and Applied Computer Science University of Würzburg Wurzburg Germany Knowledge and Data Engineering Group University of Kassel Kassel Germany

This paper presents an approach for modeling location-based profiles of social image media based on tagging information and collaborative geo-reference annotations. We utilize pattern mining techniques for obtaining sets of tags that are specific for the specified point, landmark, or region of interest. Next, we show how these candidate patterns can be presented and visualized for interactive exploration using a combination of general pattern mining visualizations and views specialized on geo-referenced tagging data. We present a case study using publicly available data from the Flickr photo sharing application.

关键词： data mining data visualization Visualization Tagging Media Histograms Microscopy

来源：评论

学校读者我要写书评

暂无评论

Managing dynamic enterprise and urgent workloads on clouds using layered queuing and historical performance models

Managing dynamic enterprise and urgent workloads on clouds u...

引用

作者： Bacigalupo, David A. Van Hemert, Jano Chen, Xiaoyu Usmani, Asif Chester, Adam P. He, Ligang Dillenberger, Donna N. Wills, Gary B. Gilbert, Lester Jarvis, Stephen A. School of Electronics and Computer Science University of Southampton United Kingdom Data-Intensive Research Group School of Informatics University of Edinburgh United Kingdom BRE Centre for Fire Safety Engineering School of Engineering University of Edinburgh United Kingdom IBM T.J. Watson Research Centre Yorktown Heights NY United States High Performance Systems Group Department of Computer Science University of Warwick United Kingdom

The automatic allocation of enterprise workload to resources can be enhanced by being able to make what-if response time predictions whilst different allocations are being considered. We experimentally investigate an historical and a layered queuing performance model and show how they can provide a good level of support for a dynamic-urgent cloud environment. Using this we define, implement and experimentally investigate the effectiveness of a prediction-based cloud workload and resource management algorithm. Based on these experimental analyses we: (i) comparatively evaluate the layered queuing and historical techniques;(ii) evaluate the effectiveness of the management algorithm in different operating scenarios;and (iii) provide guidance on using prediction-based workload and resource management. © 2011 Elsevier B.V. All rights reserved.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks

Constant approximation for virtual backbone construction wit...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Hongwei Du Qiang Ye Weili Wu Wonjun Lee Deying Li Dingzhu Du Stephen Howard Department of Computer Science and Information Technology University of Prince Edward Island Canada Department of Computer Science University of Texas Dallas USA Department of Computer Science and Engineering Korea University Seoul South Korea Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9781424499199

In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size |D| is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.

关键词： Routing Approximation methods Distributed algorithms Wireless sensor networks Polynomials computer science Electronic mail

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：