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

作者： Hotho, Andreas Pedersen, Rasmus Ulslev Wurst, Michael University Kassel Depart. of Electrical Engineering/Computer Science Knowledge and Data Engineering Group Germany Copenhagen Business School Dept. of Informatics Embedded Software Lab. Copenhagen Denmark Technical University Dortmund Computer Science LS8 44221 Dortmund Germany

ISBN: (纸本)3642163912

Ubiquitous knowledge discovery systems must be captured from many different perspectives. In earlier chapters, aspects like machine learning, underlying network technologies etc. were described. An essential component, which we shall discuss now, is still missing: Ubiquitous data. While data themselves are a central part of the knowledge discovery process, in a ubiquitous setting new challenges arise. In this context, the emergence of data itself plays a large role, therefore we label this part of KDubiq systems ubiquitous data. It clarifies the KDubiq challenges related to the multitude of available data and what we must do before we can tap into this rich information source. © 2010 Springer-Verlag.

关键词： Taps

来源：评论

学校读者我要写书评

暂无评论

Towards explanation-aware social software: Applying the mining and analysis continuum of explaining

Towards explanation-aware social software: Applying the mini...

引用

5th International Workshop on Explanation-Aware Computing, ExaCt 2010

作者： Atzmueller, Martin Roth-Berghofer, Thomas University of Kassel Knowledge and Data Engineering Group Wilhelmshöher Allee 73 34121 Kassel Germany GmbH Trippstadter Straße 122 67663 Kaiserslautern Germany Knowledge-Based Systems Group Department of Computer Science University of Kaiserslautern P.O. Box 3049 67653 Kaiserslautern Germany

data mining methods build patterns or models. When presenting these, all or part of the result needs to be explained to the user in order to be understandable and for increasing the user acceptance of the patterns. In doing that, a variety of dimensions in the Mining and Analysis Continuum of Explaining (MACE) needs to be considered, e.g., from concrete to more abstract explanations. This paper discusses the application of the MACE in the context of social software. We consider applications of the proposed approaches in three social software systems, and show how the data mining results can seamlessly be analysed on the presented continuous dimensions and levels.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Multi-facet exploration of image collections with an adaptive multi-focus zoomable interface

Multi-facet exploration of image collections with an adaptiv...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Sebastian Stober Christian Hentschel Andreas Nürnberger Data & Knowledge Engineering Group of the Faculty of Computer Science Otto-von-Guericke-University Magdeburg Germany

Sometimes it is not possible for a user to state a retrieval goal explicitly a priori. One common way to support such exploratory retrieval scenarios is to give an overview using a neighborhood-preserving projection of the collection onto two dimensions. However, neighborhood cannot always be preserved in the projection because of the dimensionality reduction. Further, there is usually more than one way to look at a collection of images - and diversity grows with the number of features that can be extracted. We describe an adaptive zoomable interface for exploration that addresses both problems: It makes use of a complex non-linear multi-focal zoom lens that exploits the distorted neighborhood relations introduced by the projection. We further introduce the concept of facet distances representing different aspects of image similarity. Given user-specific weightings of these aspects, the system can adapt to the user's way of exploring the collection by manipulation of the neighborhoods as well as the projection.

关键词： Measurement Visualization Feature extraction Image color analysis Indexing Lenses Nonlinear distortion

来源：评论

学校读者我要写书评

暂无评论

Capability description and discovery of Internetware entity

引用

science China(Information sciences) 2010年第4期53卷 685-703页

作者： WANG PuWei1*, JIN Zhi2,3* & LIU HongYan4 1Key Laboratory of data engineering and knowledge engineering of the Ministry of Education, Renmin University of China, Beijing 100872, China 2Key Laboratory of High Confidence Software Technologies of the Ministry of Education, Peking University, Beijing 100871, China 3Academy of Mathematics and System sciences, Chinese Academy of sciences, Beijing 100190, China 4Department of Management science and engineering, Tsinghua University, Beijing 100084, China 1. Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing 100872 China2. Key Laboratory of High Confidence Software Technologies of the Ministry of Education Peking University Beijing 100871 China3. Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing 100190 China4. Department of Management Science and Engineering Tsinghua University Beijing 100084 China

Internetware can be formed through aggregation of Internetware entities bottom-up to satisfy the user's requirements. In the process, capability description of Internetware entity plays an important role. This paper proposes a capability description of Internetware entity based on environment ontology. The environment ontology includes environment entities and possible interactions with the environment entities in a particular domain. Tree-like hierarchical state machines are also included in the ontology to describe domain life-cycle of the environment entities. On the basis of the ideas, the capability of Internetware entity is embodied by interacting with environment entities and the changes of the environment entities during the interactions. Finally, this paper describes the matchmaking between capability descriptions of Internetware entities to support the discovery of Internetware entity. An example of online education course is given to illustrate the ideas.

关键词： Internetware capability description domain environment ontology tree-like hierarchical state machine

来源：评论

学校读者我要写书评

暂无评论

Trust Service Discovery by Opinions Classification on Virtual Communities

Trust Service Discovery by Opinions Classification on Virtua...

引用

International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC

作者： Qing Zhu Department of Computer Science Information School Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China

ISBN: (纸本)9781424465972;9780769540115

Internet has become an excellent ecommerce platform for bringing together large numbers of buyers and sellers across wide geographic regions. Trust and reputation systems represent a. significant trend in decision support for Internet mediated service provision. However, most existing work assumes that all users have the same trust metrics, but in real life different users often have different preference of product attributes. This paper proposes trusted query navigation model by analyzing online customer reviews of trustworthiness of websites. The first step analyzes counting history feedback in the system offline and generates dynamic trust model by opinion classification. The second step presents trust evaluation ranking to help the user can easily discovery trust service of matching his needs. The experimental evaluation shows that the trusted query evaluation ranking has high trading efficiency, quick learning ability and satisfactory performance.

关键词： Business Feedback Portals History Web services Computer security data security Information security Wireless communication Computer networks

来源：评论

学校读者我要写书评

暂无评论

Extending a knowledge-based network to support temporal event reasoning

Extending a knowledge-based network to support temporal even...

引用

IEEE Symposium on Network Operations and Management

作者： John Keeney Clay Stevens Declan O'Sullivan Knowledge & Data Engineering Group & FAME School of Computer Science & Statistics Trinity College Dublin Dublin Ireland

ISBN: (纸本)9781424453665

While the polling or request/response paradigm adopted by many network and systems management approaches form the backbone of modern monitoring and management systems, the most important and interesting events, faults, alerts and log messages arrive at the management agent in a push-based asynchronous manner. However, in the management infrastructure itself, at the point where events are initially processed and matched to subscribers, there have been few attempts to identify relationships or dependencies between events. This means that most of this burden is placed on the management application, or indeed the managers themselves. This research investigates enhancing the expressiveness of a knowledge-based networking middleware with the addition of three temporal operators to be used in subscriptions to select matching events. A prototype design is presented and a number of implementations are compared. The approach is also motivated using two scenarios for temporal correlation of warnings and faults in managed networks. The effect on the scalability of the extended knowledge-based network system is also evaluated.

关键词： Subscriptions knowledge management Middleware Scalability engineering management Filtering Computer network management Routing Matched filters data engineering

来源：评论

学校读者我要写书评

暂无评论

VANETs-Based Real-time Traffic data Dissemination

VANETs-Based Real-time Traffic Data Dissemination

引用

2010 IEEE International Conference Conferenhce on Wireless Communications,Networking and Information Security(2010 IEEE 无线通信、网络技术与信息安全国际会议 WCNIS)

作者： Wenping Chen Department of Computer Science??Renmin University of China Beijing Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE

ISBN: (纸本)9781424458509

Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by leveraging the techniques of Vehicular Ad hoc Networks (VANETs) we present a real-time abnormal traffic data dissemination protocol. Specifically, all vehicles running on the same road segment are regarded as a cluster to generate traffic message about this segment. To reduce communication cost, only abnormal traffic data is issued and spread to nearby road segments. By employing event-driven and period combined mechanism, the abnormal traffic messages are disseminated to the vehicles that probably need the messages in time. We propose a distance dependent forwarder selection method to disseminate traffic message. When transmitted inside a cluster, messages are forwarded along the segment from one end to the other based on the least hops principle;while transmitted among clusters, messages are transmitted in epidemic routing mode, which ensure the fast and reliable dissemination. To evaluate the performance of our protocol, we use the real traffic data of Beijing at peak hour. The simulation results demonstrate that our protocol is feasible and efficient for metropolitan-size city.

关键词： vehicular networks traffic real-time

来源：评论

学校读者我要写书评

暂无评论

Global Top-k aggregate queries based on x-tuple in uncertain database

Global Top-k aggregate queries based on x-tuple in uncertain...

引用

24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010

作者： Liu, Dexi Wan, Changxuan Xiong, Naixue Park, Jong Hyuk Yeoe, Sang-Soo School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Dept. of Computer Science Georgia State University Atlanta GA United States Dept. of Computer Science and Engineering Seoul National University of Technology Seoul Korea Republic of Division of Computer Engineering Mokwon University Daejeon Korea Republic of

ISBN: (纸本)9780769540191

A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. As a powerful semantic of Top-k in uncertain database, Global Top-k return k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a x-tuple based method to process Global Top-k aggregate queries in uncertain database. Our method has two levels, group state generation and G-x-Top-k query processing. In the former level, group states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based Global x-tuple Top-k query processing are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2010 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Towards the use of policy decomposition for composite service management by non-expert end-users

Towards the use of policy decomposition for composite servic...

引用

IEEE Network Operations and Management Symposium Workshops (NOMS Workshops)

作者： John Keeney David Lewis Vincent Wade Knowledge & Data Engineering Group (KDEG) & FAME School of Computer Science & Statistics Trinity College Dublin Dublin Ireland

ISBN: (纸本)9781424460373;9781424460380

With the advent of Web 2.0, as web service composition gets easier, there is a trend towards nonexpert users not just consuming information and services, but also providing, aggregating, composing and eventually managing their own information, services and resources. However non-expert users need to manage their composed services in a way they can understand. Policy-based management promises the ability to control services in a consistent manner via high-level declarative directives, constraints and goals. However, a significant drawback of policy-based management for complex systems remains the lack of an automated mechanism to resolve the meaning of high-level goals so they can be enforced [1,2]. We propose an approach to compose the available heterogeneous management interfaces of underlying constituent services to produce a coherent higher-level management interface for the composite service. This composed management interface can then be presented to the user at a level of abstraction that corresponds to non-expert user's needs thereby allowing the user to express their specific requirements. Hence the user can manage their composite service, in a manner tailored to them, without the burden of needing to understand how to manage each constituent service. This supports lower-cost user-initiated management, without access to IT experts, thereby increasing productivity and lowering operating costs.

关键词： knowledge management Resource management engineering management data engineering Computer science Statistics Educational institutions Web services Information management Automatic control

来源：评论

学校读者我要写书评

暂无评论

Two novel semantics of top-k queries processing in uncertain database

Two novel semantics of top-k queries processing in uncertain...

引用

10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Liu, Dexi Wan, Changxuan Xiong, N. Yang, Laurence T. Chen, Lei Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA United States Department of Computer Science St. Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9780769541082

Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Topk queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this xtuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain xkRanks queries (U-x-kRanks) and Global x-Top-k queries (Gx- Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：