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

6th International Conference on Management of e-Commerce and e-Government, ICMeCG 2012

作者： Zhong, Min-Juan Wan, Chang-Xuan Liu, De-Xi Jiao, Xian-Pei School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9781467329439

Clustering XML search results is an effective way to improve performance. However, the key problem is how to measure similarity between XML documents. This paper studies XML search results clustering based on element granularity and proposes one similarity measurement method. The method firstly uses latent semantic indexing technology(LSI) to obtain term semantics and then combines the XML element node content and semantic structure properties(CASS). To evaluate clustering performance, two new performance evaluation methodologies, namely R-ClusterRatio and R-DocuRatio are introduced. It is motivated by the observations of relevant documents distribution and the fact that the experiment data collection, IEEE CS corpus, do not provide classification information. Experiment results show that proposed similarity method combining term semantics with content and structure semantics integration(LSI-CASS) is feasible, and it produces better clustering quality than LSI-CAS. © 2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Topology-based data compression in wireless sensor networks

Topology-based data compression in wireless sensor networks

引用

13th International Conference on Web-Age Information Management, WAIM 2012

作者： Mo, Shangfeng Chen, Hong Li, Yinglong Key Laboratory of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Hunan University of Science and Technology Xiangtan 411201 China

ISBN: (纸本)9783642322808

In this paper, we address the problem of data Compression which is critical in wireless sensor networks. We proposed a novel Topology-based data Compression (TDC) algorithm for wireless sensor networks. We utilize the topological structure of routing tree to reduce the transmission of message packets. We analyzed the differences and relations between our algorithm and other compression algorithms. Extensive experiments are conducted to evaluate the performance of the proposed TDC approach by using two kinds of data sets: real data set and synthetic data set. The results show that the TDC algorithm substantially outperforms Non-compression algorithm in terms of packets transmitted. © 2012 Springer-Verlag.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

A typology of online window shopping consumers 16

A typology of online window shopping consumers

引用

16th Pacific Asia Conference on Information Systems, PACIS 2012

作者： Liu, Fang Wang, Rong Zhang, Ping Zuo, Meiyun School of Information Renmin University of China Beijing China School of Information Studies Syracuse University SyracuseNY United States School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Consumer online shopping behaviors are well attended in the IS and marketing literature. Yet, there is another group of individuals who spend a lot of time online but do not purchase anything. This online window shopping phenomenon is intriguing to both scholars and marketers yet it is less studied and little understood. Questions such as what the online window shopping consumers do during their visits, how to differentiate their activities and how to design marketing strategies to stimulate them to buy are all essential and beg for investigation. To address this gap, we propose a typology of online window shopping consumers based on the Consumer Information Processing Model, then empirically validate and refine the typology using a set of clickstream data. The final typology contains four main types of online window shopper consumers: 1) promotion finders, 2) social & hedonic experience seekers, 3) information gatherers, and 4) learners & novices. This study extends consumer online behavior research in both e-commerce and social commerce by focusing on the specific group of consumers who only do online window shopping. Besides theoretical contributions, the findings also provide marketers and businesses with valuable references for designing targeted marketing strategies or promotional activities for online window shopping consumers.

关键词： Consumer behavior

来源：评论

学校读者我要写书评

暂无评论

Information propagation in online social networks based on user behavior

Information propagation in online social networks based on u...

引用

3rd International Conference on Information Computing and Applications, ICICA 2012

作者： Li, Niu Han, Xiaoting Key Laboratory of Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China School of Economics and Management Beihang University Beijing China

ISBN: (纸本)9783642340611

Along with the development of Internet and Web2.0, online social networks (OSNs) are becoming an important information propagation platform. Therefore, it is of great significance to study the information propagation rules in OSNs. An information propagation model named IP-OSN is proposed in this paper, and some simulation experiments are carried out to investigate the mechanism of information propagation. From the experimental results, we can see that along with the information propagation, the number of known nodes increases and reaches its maximum, then keep an unchanging status. Moreover, from the user behavior aspect, we find that different user behavior in OSNs causes different information propagation results, the more users who are willing to diffuse information, the more scope the information can propagate and the faster the information diffuses. Findings in this paper are meaningful for theory of information propagation and complex networks. © 2012 Springer-Verlag.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Overview of the INEX 2011 data-centric track

Overview of the INEX 2011 data-centric track

引用

Lecture Notes in Computer Science

作者： Wang, Qiuyue Ramírez, Georgina Marx, Maarten Theobald, Martin Kamps, Jaap School of Information Renmin University of China China Key Lab. of Data Engineering and Knowledge Engineering MOE China Universitat Pompeu Fabra Spain University of Amsterdam Netherlands Max-Planck-Institut für Informatik Germany

ISBN: (纸本)9783642357336

This paper presents an overview of the INEX 2011 data-Centric Track. Having the ad hoc search task running its second year, we introduced a new task, faceted search task, whose goal is to provide the infrastructure to investigate and evaluate different techniques and strategies of recommending facet-values to aid the user to navigate through a large set of query results and quickly identify the results of interest. The same IMDB collection as last year was used for both tasks. A total of 9 active participants contributed a total of 60 topics for both tasks and submitted 35 ad hoc search runs and 13 faceted search runs. A total of 38 ad hoc search topics were assessed, which included 18 subtopics for 13 faceted search topics. We discuss the setup for both tasks and the results obtained by their participants. © Springer-Verlag 2012.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Generalized Unique Game Problem

引用

Journal of Computational Information Systems 2012年第16期8卷 6551-6557页

作者： Cui, Peng Key Laboratory of Data Engineering and Knowledge Engineering School of Information Resource Management Renmin University of China Beijing 100872 China

In this paper, the author defines Generalized Unique Game Problem (GUGP), where weights of the edges are allowed to be negative. Two special types of GUGP are illuminated, GUGP-NWA, where the weights of all edges are negative, and GUGP-PWT (ρ), where the total weight of all edges are positive and the negative-positive ratio is at most ρ. The author investigates the counterpart of the Unique Game Conjecture on GUGP-PWT (ρ). The author shows that Unique Game Conjecture on GUGP-PWT (1) holds true, and Unique Game Conjecture on GUGP-PWT (1=2) holds true, if the 2-to-1 Conjecture holds true. The author poses an open problem whether Unique Game Conjecture holds true on GUGP-PWT (ρ) with 0 < ρ < 1. © 2012 Binary Information Press.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Framework for Personalized Management of Domain Ontologies

A Framework for Personalized Management of Domain Ontologies

引用

International Conference on Computer and Information Science (ACIS)

作者： Runnan Liu Puwei Wang Shixian Zheng Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing China

As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies to users during run time according to user preferences. It helps that users can focus on their interested parts, instead of the whole. It increases the efficiency of ontology-based application. This paper proposes a framework for personalized management of domain ontologies. In this framework, a user model firstly is introduced to describe user preferences. Secondly, domain ontologies are decomposed into moderate-scale modules with high cohesion and low coupling. During run time, modules that a user is interested in are selected out based on the user's preferences. Finally, the selected modules are combined to construct personalized views of domain ontologies for the user.

关键词： Ontologies Conferences Cognition Semantics Vectors Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Automatic extraction of foreground objects from Mars images

引用

Geo-Spatial Information Science 2012年第1期15卷 17-25页

作者： WANG Shuliang LIU Chang WU Shangru NIE Qianqian WANG Yongtao ZENG Shi ZHU Haifeng International School of Software Wuhan University129 Luoyu RoadWuhan 430079China Key Laboratory of Data Mining and Knowledge Engineering Inner Mongolia Autonomous RegionInner Mongolia UniversityHohhot 010021China Department of Geography East Michigan UniversityYpsilantiMI 48197USA

A novel method is proposed to automatically extract foreground objects from Martian surface *** characteristics of Mars images are distinct,*** illumination,low contrast between foreground and background,much noise in the background,and foreground objects with irregular *** the context of these characteristics,an image is divided into foreground objects and background *** filtering is first applied to rectify ***,wavelet transformation enhances contrast and denoises the ***,edge detection and active contour are combined to extract contours regardless of the shape of the *** results show that the method can extract foreground objects from Mars images automatically and accurately,and has many potential applications.

关键词： automatic object extraction Mars images homomorphic filtering wavelet transformation active contour edge detection

来源：评论

学校读者我要写书评

暂无评论

Efficient approximation of the maximal preference scores by lightweight cubic views

Efficient approximation of the maximal preference scores by ...

引用

15th International Conference on Extending database Technology, EDBT 2012

作者： Chen, Yueguo Cui, Bin Du, Xiaoyong Tung, Anthony K. H. Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China Department of Computer Science Peking University Beijing China School of Information Renmin University of China Beijing China School of Computing National University of Singapore Singapore Singapore

ISBN: (纸本)9781450307901

Given a multi-features data set, a best preference query (BPQ) computes the maximal preference score (MPS) that the tuples in the data set can achieve with respect to a preference function. BPQs are very useful in applications where users want to efficiently check whether many individual data sets contain tuples that are of interest to them. Although a BPQ can be naïvely answered by issuing a top-1 query and computing the score from the returned tuple, doing so might require to load a larger number of tuples externally. In this paper, we address the problem of efficient processing BPQs by using lightweight cubic (3-dimensional) views. With these in-memory views, the MPSs of BPQs can be efficiently estimated with an error bound guaranteed, by paying only a small number of I/Os. Extensive experimental results over real-life data sets show that our approximate solution can achieve the efficiency of up to three orders of magnitude compared to exact solutions, with certain accuracy guaranteed. © 2012 ACM.

关键词： best preference score materialized views preference query top-k query

来源：评论

学校读者我要写书评

暂无评论

Bayesian network structure learning from attribute uncertain data

Bayesian network structure learning from attribute uncertain...

引用

13th International Conference on Web-Age Information Management, WAIM 2012

作者： Song, Wenting Yu, Jeffrey Xu Cheng, Hong Liu, Hongyan He, Jun Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China Chinese University of Hong Kong Hong Kong Hong Kong Department of Manage. Sci. and Eng. Tsinghua University China

ISBN: (纸本)9783642322808

In recent years there has been a growing interest in Bayesian Network learning from uncertain data. While many researchers focus on Bayesian Network learning from data with tuple uncertainty, Bayesian Network structure learning from data with attribute uncertainty gets little attention. In this paper we make a clear definition of attribute uncertain data and Bayesian Network Learning problem from such data. We propose a structure learning method named DTAU based on information theory. The algorithm assumes that the structure of a Bayesian network is a tree. It avoids enumerating all possible worlds. The dependency tree is computed with polynomial time complexity. We conduct experiments to demonstrate the effectiveness and efficiency of our method. The experiments show the clustering results on uncertain dataset by our dependency tree are acceptable. © 2012 Springer-Verlag.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：