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

International Conference on computer and Information Technology (CIT)

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

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 Top-k 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 x-tuple 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 x-kRanks queries (U-x-kRanks) and Global x-Top-k queries (G-x-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.

关键词： Semantics Upper bound Heuristic algorithms Query processing Equations Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Multi-language Ontology-Based Search Engine

Multi-language Ontology-Based Search Engine

引用

International Conference on Advances in computer-Human Interaction

作者： Leyla Zhuhadar Olfa Nasraoui Robert Wyatt Elizabeth Romero Knowledge Discovery and Web Mining Laboratory Department of Computer Engineering and Computer Science University of Louisville KY USA The Office of Distance Learning Division of Extended Learning and Outreach Western Kentucky University KY USA

ISBN: (纸本)9781424456932;9780769539577

One of the first Multi-Language Information Retrieval (MLIR) systems was implemented in 1969 by Gerard Salton who enhanced his SMART system to retrieve multilingual documents in two languages, English and German. However, the research field of MLIR is still struggling since the majority of information retrieval systems are monolingual and more precisely English-based, even though only 6% of the world's population native language have as English [14]. This paper presents a Multi-Language Information Retrieval (MLIR) approach that falls into the area of Domain Specific Information Retrieval (E-learning being the domain). The approach we followed is a synergistic approach between (1) Thesaurus-based Approach and (2) Corpus-based Approach. This research has been implemented on a real platform called HyperManyMedia 1 at Western Kentucky University.

关键词： Ontologies Search engines Information retrieval Natural languages Electronic learning System testing Web mining knowledge engineering computer science computer aided instruction

来源：评论

学校读者我要写书评

暂无评论

MMIR: Mining Multi-scale Intervention Rules in Sub-Complex System

MMIR: Mining Multi-scale Intervention Rules in Sub-Complex S...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Zheng Jiaoling Tang Changjie Qiao Shaojie Yang Ning Wang Yue Chen Yu Zhu Jun Department of Software Engineering Chengdu University of Information and Technology Chengdu China Institute of Database and Knowledge Engineering School of Computer Science Sichuan University Chengdu China School of Information Science and Technology Southwest Jiaotong University Chengdu China

Intervention analysis is the common method to reveal relationships between objects in human as well as biological society. Data mining research community is just starting to pay attention to intervention analysis. As the traditional association rules are not successful at measuring intervention, this paper tries to mining intervention rules from time series data of sub-complex system. The main contributions of this study include: (1) introduces a new concept of intervention rules. It can quantitatively detect at what scale, how intensive and how long the intervention does make sense; (2) conduct wavelet transform on time series. The decomposition scale can denotes the intervention scale; (3) proposes a new concept named directional correlation to measure intervention intensity; (4) calculates the intervention intensity between time series data with different time delays. The time delay can uncover after how long the intervention takes place; (5) conducts experiments on real datasets. The results show that intervention rules do exist at different decomposition scale of the original data. Moreover, the number of rules discovered by multi-scale analyzing methods is always 4 or 5 times more than those found by single scale methods. And the stability of rules discovered by the improved multi-scale mining algorithm MMIR* is always 100%, while the stability of rules discovered by the basic multi-scale mining algorithm MMIR fluctuate around 70%.

关键词： Heart rate Data mining Delay effects Stability Frequency Association rules Time measurement Control systems Databases knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

SPARQL2XQuery 2.0: Supporting Semantic-based queries over XML data

SPARQL2XQuery 2.0: Supporting Semantic-based queries over XM...

引用

International Workshop on Semantic Media Adaptation and Personalization (SMAP)

作者： Ioannis Stavrakantonakis Chrisa Tsinaraki Nikos Bikakis Nektarios Gioldasis Stavros Christodoulakis MUSIC/TUC Technical University of Crete Greece Department of Information Engineering and Computer Science University of Trento Italy Knowledge and Database Systems Laboratory National and Technical University of Athens Greece

The dominant standards in multimedia content and service description, namely the MPEG-7 and the MPEG-21, have been expressed in XML Schema syntax. In addition, ontologies that capture the semantics of these standards have been developed using the semantic web languages. Since different communities in the industry and the academia work and are familiar with the Semantic Web environment or the XML environment, a Schema mapping framework and a Query mapping framework are needed that will allow querying multimedia content and service descriptions in a uniform way in both the XML and Semantic Web environments. We present in this paper SPARQL2XQuery 2.0, a framework that allows expressing semantic queries on top of XML data through the translation of SPARQL queries in XQuery syntax. SPARQL2XQuery 2.0 may work with both existing ontologies and with automatically produced ones, formed according to our XS2-OWL 2.0 transformation model. XS2-OWL 2.0 exploits the OWL 2.0 semantics and supports the new XML constructs introduced by XML Schema 1.1.

关键词： XML Ontologies OWL Syntactics Semantics Resource description framework

来源：评论

学校读者我要写书评

暂无评论

Semantic Subspace Learning with conditional significance vectors

Semantic Subspace Learning with conditional significance vec...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Nandita Tripathi Stefan Wermter Chihli Hung Michael Oakes Department of Computing Engineering and Technology University of Sunderland Sunderland UK Institute for Knowledge Technology Department of Computer Science University of Hamburg Hamburg Germany Department of Information Management Chung Yuan Christian University Chungli Taiwan

Subspace detection and processing is receiving more attention nowadays as a method to speed up search and reduce processing overload. Subspace Learning algorithms try to detect low dimensional subspaces in the data which minimize the intra-class separation while maximizing the inter-class separation. In this paper we present a novel technique using the maximum significance value to detect a semantic subspace. We further modify the document vector using conditional significance to represent the subspace. This enhances the distinction between classes within the subspace. We compare our method against TFIDF with PCA and show that it consistently outperforms the baseline with a large margin when tested with a wide variety of learning algorithms. Our results show that the combination of subspace detection and conditional significance vectors improves subspace learning.

关键词： Classification algorithms Semantics Training Support vector machine classification Principal component analysis Prediction algorithms Testing

来源：评论

学校读者我要写书评

暂无评论

SLA Validation of Service Value Chains

SLA Validation of Service Value Chains

引用

The Ninth International Conference on Grid and Cloud Computing(第九届网格与云计算国际学术会议 GCC 2010)

作者： Irfan Ul Haq Erich Schikuta Ivona Brandic Adrian Paschke Harold Boley Department of Knowledge and Business Engineering University of Vienna Austria Information Systems Institute Vienna University of Technology Austria Institute of Computer Science Freie University Berlin Germany Institute of Information Technology National Research Council Canada

Business-to-Business (B2B) workflow/service interoperation across Virtual Organisations (VOs) brings about novel business scenarios. In these scenarios, parts of workflows (or services) corresponding to different partners can be aggregated in a producer-consumer manner, leading to hierarchical structures of added value interpreted as service value chains. Service Level Agreements (SLAs), which are contracts between service providers and service consumers, guarantee the expected quality of service (QoS) to different stakeholders at various levels of a service value chain. The essential requirements for such an SLA-based choreography of services include agile component-based infrastructure to support the corresponding choreography of their SLAs;proactive validation of SLAs to prevent violations;reactive validation of SLAs for penalty enforcement and breach management;and business enabling requirements such as trust, privacy, security and automation. In this paper we highlight the significance of these issues and propose their solutions. We then proceed to weave these solution components together into a comprehensive SLA validation framework that blends together two major systems: a rule based distributed system for SLA validation and a service monitoring system for the prevention of SLA violations.

关键词： Service Level Agreements Service Value Chains Value Networks SLA Validation SLA Management Rule-Based Systems Pragmatic Web

来源：评论

学校读者我要写书评

暂无评论

Ontology based automatic attributes extracting and queries translating for deep web

Journal of Software

引用

Journal of Software 2010年第7期5卷 713-720页

作者： Liang, Hao Ren, Fei Zuo, Wanli He, Fengling College of Computer Science and Technology Jilin University Changchun 130012 China Department of Information Changchun Taxation College Changchun 130117 China China Development Bank Center of Operations Beijing 100037 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China

Search engines and web crawlers can not access the Deep Web directly. The workable way to access the hidden database is through query interfaces. Automatic extracting attributes from query interfaces and translating queries is a solvable way for addressing the current limitations in accessing Deep Web. However, the query interface provides semantic constraints, some attributes are co-occurred and the others are exclusive sometimes. To generate a valid query, we have to reconcile the key attributes and semantic relation between them. We design a framework to automatically extract attributes from query interfaces taking full advantage of instances information and enrich the attribute sets embedded in the semantic query interface by Ontology technique. Each attribute is extended into a candidate attribute expressed by a hierarchy tree and describes the semantic relation of the attributes. We carry out our experiments in the real-world domain and results showed the validation of query translation framework. © 2010 ACADEMY PUBLISHER.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A hybrid discrete PSO-SA algorithm to find optimal elimination orderings for Bayesian networks

A hybrid discrete PSO-SA algorithm to find optimal eliminati...

引用

International Conference on Industrial and Information Systems, IIS

作者： Xuchu Dong Dantong Ouyang Dianbo Cai Yonggang Zhang Yuxin Ye Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun Jilin China Network Monitor Maintenance Centre China Telecom Corporation Limited Changchun Jilin China

In this paper, a hybrid algorithm named DPSOSA is proposed to find near-to-optimal elimination orderings in Bayesian networks. DPSO-SA is a discrete particle swarm optimization method enhanced by simulated annealing. ... 详细信息

关键词： Computational modeling Adaptation model

来源：评论

学校读者我要写书评

暂无评论

An adaptive multi-heuristic ant colony system for finding optimal elimination orderings in Bayesian networks

An adaptive multi-heuristic ant colony system for finding op...

引用

International Conference on Electrical engineering, Computing science and Automatic Control (CCE)

作者： Xuchu Dong Yonggang Zhang Dianbo Cai Haihong Yu Yuxin Ye Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun Jilin China Network Monitor Maintenance Centre China Telecom Corporation Limited Changchun Jilin China

To find an optimal elimination ordering for Bayesian networks, a multi-heuristic-based ant colony system named MHC-HS-ACS is proposed. MHC-HS-ACS uses a set of heuristics to guide the ants to search solutions. The heuristic set can evolve with the searching procedure in an adaptive way. MHC-HS-ACS also utilizes a heuristic-based local search to accelerate its convergence. Computational experiments show that MHC-HS-ACS can find very high quality solutions.

关键词： Bayesian methods Ethics Junctions Conferences Electrical engineering IEEE catalog Inference algorithms

来源：评论

学校读者我要写书评

暂无评论

Cooperative coevolutionary genetic algorithms to find optimal elimination orderings for Bayesian networks

Cooperative coevolutionary genetic algorithms to find optima...

引用

International Conference on Bio-Inspired Computing: Theories and Applications, BICTA

作者： Xuchu Dong HaiHong Yu Dantong Ouyang Dianbo Cai Yuxin Ye Yonggang Zhang Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun Jilin China Network Monitor Maintenance Centre China Telecom Corporation Limited Changchun Jilin China

According to the characteristics of the optimal elimination ordering problem in Bayesian networks, a heuristic-based genetic algorithm, a cooperative coevolutionary genetic framework and five grouping schemes are proposed. Based on these works, six cooperative coevolutionary genetic algorithms are constructed. Numerical experiments show that these algorithms are more robust than other existing swarm intelligence methods when solving the elimination ordering problem.

关键词： Genetics Bayesian methods Robustness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：