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

Web of data and web of entities: Identity and reference in interlinked data in the semantic web

Philosophy and Technology 2012年第1期25卷 5-26页

作者： Bouquet, Paolo Stoermer, Heiko Vignolo, Massimiliano Department of Information Engineering and Computer Science University of Trento Trento Italy Fondazione Bruno Kessler Data Knowledge Management Unit Trento Trento Italy

Using web standards, such as uniform resource identifiers (URIs), XML and HTTP, for naming and describing resources which are not information objects is the key difference between the Web as we know it today and the Semantic Web. Naming and interlinking this type of resources by HTTP URIs (instead of individual constants in a formal language) is the key feature which distinguishes traditional knowledge representation from web-scale knowledge representation. However, this use of URIs brought back attention to the old philosophical problem of identity and reference in a new form. In this paper, we analyze the new version of the problem, provide a formal model for dealing with it when interlinking knowledge on the Web, and argue for the need of a distinction between the use of URIs for describing and accessing resources, and the use of URIs for fixing the reference. We show that in the current practice of linking data these roles are not clearly distinguished, and that this fact may cause unwanted effects and prevent some basic forms of data integration. We also discuss the role of an entity name system as a potential piece of infrastructure for fixing the reference in the Semantic Web. © 2011 Springer-Verlag.

关键词： Identity Linked data Reference Resource Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Adaptation and enhancement of evaluation measures to overlapping graph clusterings

Adaptation and enhancement of evaluation measures to overlap...

引用

1st International Conference on Pattern Recognition Applications and Methods, ICPRAM 2012

作者： Gossen, Tatiana Kotzyba, Michael Nürnberger, Andreas Data and Knowledge Engineering Group Faculty of Computer Science Otto-von-Guericke-University Magdeburg D-39106 Magdeburg Germany

ISBN: (纸本)9789898425980

Quality measures are important to evaluate graph clustering algorithms by providing a means to assess the quality of a derived cluster structure. In this paper, we focus on overlapping graph structures, as many real-world networks have a structure of highly overlapping cohesive groups. We propose three methods to adapt existing crisp quality measures such that they can handle graph overlaps correctly, but also ensure that their properties for the evaluation of crisp graph clusterings are preserved when assessing a crisp cluster structure. We demonstrate our methods on such measures as Density, Newman's modularity and Conductance. We also propose an enhancement of an existing modularity measure for networks with overlapping structure. The newly proposed measures are analysed using experiments on artificial graphs that possess overlapping structure. For this evaluation, we apply a graph generation model that creates clustered graphs with overlaps that are similar to real-world networks i.e. their node degree and cluster size distribution follow a power law.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Gesture spotting for controlling a mobile assistance system for service and maintenance 42

Gesture spotting for controlling a mobile assistance system ...

引用

42. Jahrestagung der Gesellschaft fur Informatik e.V. ,GI, Informatik 2012 - 42nd Annual Meeting of the German Informatics Society (GI), Informatics 2012

作者： Hein, Albert Low, Thomas Hensch, Maximilian Kirste, Thomas Nürnberger, Andreas Dept. of Computer Science University of Rostock Germany Data and Knowledge Engineering Group Otto-von-Guericke University Magdeburg Germany

ISBN: (纸本)9783885796022

As information technology interweaves with our daily environment, new modes of interaction will be required. In this paper, we suggest a gesture-based approach and present a prototypical case study for a gesture controlled mobile assistant system for an industrial application domain. We discuss a number of design requirements, that are common to gesture-based interaction techniques, describe the resulting system architecture, as well as the training and recognition process, and an experimental evaluation. We will show that even without too much effort such a system can be realized with standard hardware and algorithms, and still achieve very robust recognition results. © 2012 Gesellschaft fur Informatik (GI). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Combining spatial cloaking and dummy generation for location privacy preserving

Combining spatial cloaking and dummy generation for location...

引用

8th International Conference on Advanced data Mining and Applications, ADMA 2012

作者： Xu, Nana Zhu, Dan Liu, Hongyan He, Jun Du, Xiaoyong Liu, Tao Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783642355264

Location privacy preserving is attracting more and more attentions with the wide use of accurate positioning devices. Two kinds of methods based on k-anonymity have been proposed for location privacy preserving. One is spatial cloaking and the other is dummy generation. However, simple cloaking may result in large cloaking region, especially when user distribution is sparse. Large cloaking region means low efficiency and high time cost. Dummy generation will also arouse great extra system cost. In this paper, we propose an approach that combines the two techniques to achieve an ideal complement. On one hand, cloaking algorithm is used to blur precise location into a region so that location privacy can be well protected. On the other hand, to those users whose cloaking region is large, generating limited number of dummies can help decrease the size of region. The effectiveness of our methods has been demonstrated by comprehensive experiments. © Springer-Verlag 2012.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Effectively grouping named entities from clickthrough data into clusters of generated keywords 16

Effectively grouping named entities from clickthrough data i...

引用

16th Pacific Asia Conference on Information Systems, PACIS 2012

作者： Jiang, Xuan Liu, Hongyan He, Jun Zhu, Rui Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

Many studies show that named entities are closely related to users' search behaviors, which brings increasing interest in studying named entities in search logs recently. This paper addresses the problem of forming fine grained semantic clusters of named entities within a broad domain such as "company", and generating keywords for each cluster, which help users to interpret the embedded semantic information in the cluster. By exploring contexts, URLs and session IDs as features of named entities, a three-phase approach proposed in this paper first disambiguates named entities according to the features. Then it properly weights the features with a novel measurement, calculates the semantic similarity between named entities with the weighted feature space, and clusters named entities accordingly. After that, keywords for the clusters are generated using a text-oriented graph ranking algorithm. Each phase of the proposed approach solves problems that are not addressed in existing works, and experimental results obtained from a real click through data demonstrate the effectiveness of the proposed approach.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Describing locations using tags and images: Explorative pattern mining in social media

Describing locations using tags and images: Explorative patt...

引用

2nd International Workshop on Modeling and Mining Ubiquitous Social Media, MSM 2011, MUSE 2011

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

ISBN: (纸本)9783642336836

This paper presents an approach for explorative pattern mining in social 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 platform. © 2012 Springer-Verlag.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A machine learning approach for instance matching based on similarity metrics

A machine learning approach for instance matching based on s...

引用

11th International Semantic Web Conference, ISWC 2012

作者： Rong, Shu Niu, Xing Xiang, Evan Wei Wang, Haofen Yang, Qiang Yu, Yong APEX Data and Knowledge Management Lab Shanghai Jiao Tong University China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9783642351754

The Linking Open data (LOD) project is an ongoing effort to construct a global data space, i.e. the Web of data. One important part of this project is to establish owl:sameAs links among structured data sources. Such links indicate equivalent instances that refer to the same real-world object. The problem of discovering owl:sameAs links between pairwise data sources is called instance matching. Most of the existing approaches addressing this problem rely on the quality of prior schema matching, which is not always good enough in the LOD scenario. In this paper, we propose a schema-independent instance-pair similarity metric based on several general descriptive features. We transform the instance matching problem to the binary classification problem and solve it by machine learning algorithms. Furthermore, we employ some transfer learning methods to utilize the existing owl:sameAs links in LOD to reduce the demand for labeled data. We carry out experiments on some datasets of OAEI2010. The results show that our method performs well on real-world LOD data and outperforms the participants of OAEI2010. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Generic pattern trees for exhaustive exceptional model mining

Generic pattern trees for exhaustive exceptional model minin...

引用

2012 European Conference on Machine Learning and Principles and Practice of knowledge Discovery in databases, ECML-PKDD 2012

作者： Lemmerich, Florian Becker, Martin Atzmueller, Martin Artificial Intelligence and Applied Computer Science Group University of Würzburg Würzburg D-97074 Germany Knowledge and Data Engineering Group University of Kassel Kassel 34121 Germany

ISBN: (纸本)9783642334856

Exceptional model mining has been proposed as a variant of subgroup discovery especially focusing on complex target concepts. Currently, efficient mining algorithms are limited to heuristic (non exhaustive) methods. In this paper, we propose a novel approach for fast exhaustive exceptional model mining: We introduce the concept of valuation bases as an intermediate condensed data representation, and present the general GP-growth algorithm based on FP-growth. Furthermore, we discuss the scope of the proposed approach by drawing an analogy to data stream mining and provide examples for several different model classes. Runtime experiments show improvements of more than an order of magnitude in comparison to a naive exhaustive depth-first search. © 2012 Springer-Verlag.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A brief overview of tools and evaluation methods

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7250卷 287-300页

作者： Gossen, Tatiana Nitsche, Marcus Haun, Stefan Nürnberger, Andreas Data and Knowledge Engineering Group Faculty of Computer Science Otto-von-Guericke-University Germany

ISBN: (纸本)9783642318290

In this chapter we explain the definition of the term (data) exploration. We refine this definition in the context of browsing, navigating and searching. We provide a definition of bisociative exploration and derive requirements on user interfaces, which are designed to support bisociative knowledge discovery. We discuss how to support subtasks of bisociative data exploration with appropriate user interface elements. We also present a set of exploratory tools, which are currently available or in development. Finally, we discuss the problem of usability evaluation in the context of exploratory search. Two main issues - complexity and comparability - are explained and possible solutions proposed. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Exploration: Overview

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7250卷 285-286页

作者： Nürnberger, Andreas Data and Knowledge Engineering Group Faculty of Computer Science Otto-von-Guericke-University Germany

ISBN: (纸本)9783642318290

In the previous chapters of this book quite different approaches to create networks based on existing data collections (Part II) have been discussed and diverse methods for network analysis have been proposed (Part III). All these methods provide powerful means in order to obtain different insights into the properties of huge information networks or graphs. However, one disadavantage of these individual approaches is that each approach provides only specific facets of information to the end user. Integrated exploration tools that enable the interactive exploration of huge graphs and data collections using data viusalization, aggregation and mining methods could be much more beneficial for the (interactive) task of finding bisociations. Therefore, we present and discuss in this part of the book methods for interactive exploration that bring these fields together. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： data acquisition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：