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

30th International Conference on Software engineering and knowledge engineering, SEKE 2018

作者： Sun, Caihong Zhang, Meina Zuo, Meiyun Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China

ISBN: (纸本)1891706446

In this paper, we focus on examining the effects of Ad-context on the click-Through rate (CTR) for the online advertising. Many researches have shown that ad-context congruity is a key factor to CTR, but the features of ad-context are rarely introduced in CTR prediction algorithms. By leveraging data from various sources, and using text mining and sentiment analysis techniques, our proposed approach extracts three types of features (i.e. users, advertisements and ad-context features) to predict CTR. User features describe "Who" is browsing the webpage, advertisement features depict "How" an ad serving is, and ad-context features include "What" the product is, "Where" an ad displays, as well as the "Mood" of the context. Experiment results show that our proposed approach outperforms the benchmark models by introducing ad-context features. Novel ad-context features we proposed make good contributions to the prediction of CTR. The research highlights the power of ad-context in online advertising CTR prediction. Moreover it gives an insight into supporting effective advertising and improving users' satisfaction. © 2018 Universitat zu Koln. All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A WSMO-based semantic web services discovery framework in heterogeneous ontologies environment

引用

2nd International Conference on knowledge Science, engineering and Management, KSEM 2007

作者： Haihua, Li Xiaoyong, Du Xuan, Tian School of Information Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)9783540767183

Nowadays, WSMO (Web Service Modeling Ontology)1 has received great attention of academic and business communities, since its potential to achieve dynamic and scalable infrastructure for web services is extracted. Therefore, we design an ontology-based Semantic Web Services (SWSs) discovery framework based on WSMO so as to searching dynamically web services located at different nodes. Also, we provide several SWSs matching techniques based on this framework. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Optimization framework for distributed clustering scheme in wireless sensor networks

Optimization framework for distributed clustering scheme in ...

引用

SNPD 2007: 8th ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

作者： Yongxuan, Lai Xiaobo, Fan Hong, Chen Tingting, Xie School of Information Renmin University of China Beijing Key Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)0769529097

Recently there have been growing interests in the applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach and data gathering protocol in wireless sensor networks. In this paper, we propose a novel optimization framework called MICA (MICa Adjustments) for clustering scheme in wireless sensor networks. MICA takes the cluster as a whole, and dynamically adjusts the clusters according to the real-lime workload of the local clusters to balance energy consumption among clusters. The adjustments can also deal with link failures. Simulation results show that MICA can be easily embedded into existing clustering schemes to balance the energy consumptions among the clusters, and to prolong the lifetime of wireless sensor networks. © 2007 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Gender Disparity in Expressed Emotions within Health-Related Online Support Groups

引用

Proceedings of the Association for Information Science and Technology 2021年第1期58卷 883-885页

作者： Zhao, Yuehua Wang, Hao Deng, Sanhong Chen, Ye Nanjing University Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing China Central China Normal University Wuhan China

Online support groups offer a new way to users to communicate with others regarding certain health issues. Taking autism-related support groups on Facebook as an example, we examine whether the expressed emotions differ between female and male users in online health-related support groups and whether such gender disparity varied based on the topics of the groups. Experimental results reveal a significant gender difference of expressed emotions in the groups. We find that female users tended to express more positive emotions in the group discussions than the male group members did. In addition, users appeared to express different sentiments within the groups focused on various topics. Male users tend to convey more negative emotions in the group that related to treatment, while female users were more positive when posted in the research-related group than male users were. This study is beneficial for tracking and moderating the emotional environment in online support groups. 84 Annual Meeting of the Association for Information Science & Technology | Oct. 29 – Nov. 3, 2021 | Salt Lake City, UT. Author(s) retain copyright, but ASIS&T receives an exclusive publication license.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

PULASki: Learning inter-rater variability using statistical distances to improve probabilistic segmentation

引用

Medical Image Analysis 2025年 103卷 103623页

作者： Chatterjee, Soumick Gaidzik, Franziska Sciarra, Alessandro Mattern, Hendrik Janiga, Gábor Speck, Oliver Nürnberger, Andreas Pathiraja, Sahani Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy Laboratory of Fluid Dynamics and Technical Flows Otto von Guericke University Magdeburg Germany Department of Biomedical Magnetic Resonance Faculty of Natural Sciences Otto von Guericke University Magdeburg Germany MedDigit Department of Neurology Medical Faculty University Hospital Magdeburg Germany German Centre for Neurodegenerative Disease Magdeburg Germany Centre for Behavioural Brain Sciences Magdeburg Germany School of Mathematics & Statistics UNSW Sydney Australia

In the domain of medical imaging, many supervised learning based methods for segmentation face several challenges such as high variability in annotations from multiple experts, paucity of labelled data and class imbalanced datasets. These issues may result in segmentations that lack the requisite precision for clinical analysis and can be misleadingly overconfident without associated uncertainty quantification. This work proposes the PULASki method as a computationally efficient generative tool for biomedical image segmentation that accurately captures variability in expert annotations, even in small datasets. This approach makes use of an improved loss function based on statistical distances in a conditional variational autoencoder structure (Probabilistic UNet), which improves learning of the conditional decoder compared to the standard cross-entropy particularly in class imbalanced problems. The proposed method was analysed for two structurally different segmentation tasks (intracranial vessel and multiple sclerosis (MS) lesion) and compare our results to four well-established baselines in terms of quantitative metrics and qualitative output. These experiments involve class-imbalanced datasets characterised by challenging features, including suboptimal signal-to-noise ratios and high ambiguity. Empirical results demonstrate the PULASKi method outperforms all baselines at the 5% significance level. Our experiments are also of the first to present a comparative study of the computationally feasible segmentation of complex geometries using 3D patches and the traditional use of 2D slices. The generated segmentations are shown to be much more anatomically plausible than in the 2D case, particularly for the vessel task. Our method can also be applied to a wide range of multi-label segmentation tasks and is useful for downstream tasks such as hemodynamic modelling (computational fluid dynamics and data assimilation), clinical decision making, and treatment planning. © 2

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Weighted neural bag-of-n-grams model: New baselines for text classification 26

Weighted neural bag-of-n-grams model: New baselines for text...

引用

26th International Conference on Computational Linguistics, COLING 2016

作者： Li, Bofang Zhao, Zhe Liu, Tao Wang, Puwei Du, Xiaoyong School of Information Renmin University of China Key laboratory of Data Engineering and Knowledge Engineering MOE China

ISBN: (纸本)9784879747020

NBSVM is one of the most popular methods for text classification and has been widely used as baselines for various text representation approaches. It uses Naive Bayes (NB) feature to weight sparse bag-of-n-grams representation. N-gram captures word order in short context and NB feature assigns more weights to those important words. However, NBSVM suffers from sparsity problem and is reported to be exceeded by newly proposed distributed (dense) text representations learned by neural networks. In this paper, we transfer the n-grams and NB weighting to neural models. We train n-gram embeddings and use NB weighting to guide the neural models to focus on important words. In fact, our methods can be viewed as distributed (dense) counterparts of sparse bag-of-n-grams in NBSVM. We discover that n-grams and NB weighting are also effective in distributed representations. As a result, our models achieve new strong baselines on 9 text classification datasets, e.g. on IMDB dataset, we reach performance of 93.5% accuracy, which exceeds previous state-of-the-art results obtained by deep neural models. All source codes are publicly available at https://***/zhezhaoa/neural-BOW-toolkit. © 1963-2018 ACL.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Reduce pruning cost to accelerate multimedia kNN search over MBRs based index structures

Reduce pruning cost to accelerate multimedia kNN search over...

引用

3rd International Conference on Multimedia Information Networking and Security, MINES 2011

作者： Li, Hui Zhang, Xiao Wang, Shan School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

ISBN: (纸本)9780769545592

MBR (Minimum Bounding Rectangle) has been widely used to represent multimedia data objects for multimedia indexing techniques. In kNN search, MINDIST and MINMAXDIST was the most popular pruning metrics employed by MBR based index structures. However, with the increase of dimensionality, the computation costs of above two metrics are expensive, and the involved distance computations may become the considerable component. In this paper, to improve the performance of kNN search over multimedia data, we proposed an approach to reduce the computation cost of pruning heuristics by use the cheap upper bound of MINMAXDIST instead of its precise value, and then we derive enhanced cheap heuristics based on this upper bound for kNN pruning, which are helpful to avoid visiting unnecessary data objects and MBRs. We conducted an extensive experimental study on a large real-life multimedia dataset called MSRA-MM 2.0, obtained from the commercial Bing Image search engine. The results show that the proposed approach significantly reduced the computation cost and boosted the overall performance of MBR based multimedia kNN search. © 2011 IEEE.

关键词： Cost reduction

来源：评论

学校读者我要写书评

暂无评论

Towards a topic discovery and tracking system with application to news items 2nd

Towards a topic discovery and tracking system with applicati...

引用

2nd International Workshop on Future and Emerging Trends in Language Technology, FETLT 2016

作者： Brüggermann, Daniel Hermey, Yannik Orth, Carsten Schneider, Darius Selzer, Stefan Spanakis, Gerasimos Department of Data Science and Knowledge Engineering Maastricht University Maastricht6200 MD Netherlands

ISBN: (纸本)9783319693644

Rapid proliferation of the World Wide Web led to an enormous increase in the availability of textual corpora. In this paper, the problem of topic detection and tracking is considered with application to news items. The proposed approach explores two algorithms (Non-Negative Matrix Factorization and a dynamic version of Latent Dirichlet Allocation (DLDA)) over discrete time steps and makes it possible to identify topics within storylines as they appear and track them through time. Moreover, emphasis is given to the visualization and interaction with the results through the implementation of a graphical tool (regardless the approach). Experimental analysis on Reuters RCV1 corpus and the Reuters 2015 archive reveals that explored approaches can be effectively used as tools for identifying topic appearances and their evolutions while at the same time allowing for an efficient visualization. © 2017, Springer International Publishing AG.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

One tag to bind them all: Measuring term abstractness in social metadata?

One tag to bind them all: Measuring term abstractness in soc...

引用

Symposium on Learning, knowledge, and Adaptivity 2011, LWA 2011

作者： Benz, Dominik Körner, Christian Hotho, Andreas Stumme, Gerd Strohmaier, Markus Knowledge and Data Engineering Group University of Kassel Germany Knowledge Management Institute Graz University of Technology Austria Data Mining and Information Retrieval Group University of Wurzburg Germany

Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tagabstrcatsness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of wordabstrcatness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Abstract vs concrete clabjects in Dual Deep Instantiation

Abstract vs concrete clabjects in Dual Deep Instantiation

引用

Workshop on Multi-Level Modelling, MULTI 2014, Co-located with ACM/IEEE 17th International Conference on Model Driven engineering Languages and Systems, MoDELS 2014

作者： Neumayr, Bernd Schrefl, Michael Department of Business Informatics - Data and Knowledge Engineering Johannes Kepler University Linz Austria

Deep Instantiation allows for a compact representation of models with multiple instantiation levels where clabjects combine object and class facets and allow to characterize the schema of model elements several instantiation levels below. Clabjects with common properties may be generalized to superclabjects. In order to clarify the exact nature of superclabjects, Dual Deep Instantiation, a variation of Deep Instantiation, distinguishes between abstract and concrete clabjects and demands that superclabjects are abstract. An abstract clabject combines the notion of abstract class, i.e., it may not be instantiated by concrete objects, and of abstract object, i.e., is does not represent a single concrete object but properties common to a set of concrete objects. This paper clarifies the distinction between abstract and concrete clabjects and discusses the role of concrete clabjects for mandatory constraints at multiple levels and for coping with dual inheritance introduced with the combination of generalization and deep instantiation. The reflections in this paper are formalized based on a simplified form of dual deep instantiation but should be relevant to deep characterization in general.

关键词： Concretes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：