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

Towards multilingual user models for Personalized multilingual Information Retrieval

Towards multilingual user models for Personalized multilingu...

1st Workshop on Personalised Multilingual Hypertext Retrieval, PMHR 2011, Held in Conjunction with the ACM Hypertext 2011, HT2011

作者： Ghorab, M. Rami Zhou, Dong Ben, Steichen Wade, Vincent Centre for Next Generation Localisation Knowledge and Data Engineering Group School of Computer Science and Statistics Dublin 2 Ireland

ISBN: (纸本)9781450308977

The majority of studies in Personalized Information Retrieval (PIR) literature have focused on monolingual IR, and only relatively little work has been done concerning multilingual IR. In this paper we propose a novel method to represent user models in a multilingual fashion. We argue that such representation would be more suitable for Personalized Multilingual Information Retrieval (PMIR). Furthermore, we outline two algorithms for query adaptation based on user information from the multilingual user model. © 2011 ACM.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

NEI:A framework for dynamic news event exploration and visualization 14

NEI:A framework for dynamic news event exploration and visua...

引用

7th International Symposium on Visual Information Communication and Interaction, VINCI 2014

作者： Guo, Xiaofei Li, Juanzi Yang, Ruibing Ma, Xiaoli Knowledge Engineering Group Department of Computer Science and Technology Tsinghua University 10084 China

ISBN: (纸本)9781450327657

Nowadays, there are many events reported by News Media everyday, which contains a massive number of news. People are getting more and more interested in understanding how an event evolves after it happens. News related to the same event or similar events usually has more common entities and stronger topic correlations, which is a new perspective to study news event. Due to the complexity of event evolving process, event visualization has been a big challenge for a long time. In this paper, we design a novel four-phase framework NEI(News Event Insight) that focuses on visualizing a news event properly and clearly, namely (1)Entity Topic Modeling. We extract topics and entities through timeline. (2)Temporal Topic Correlation Analysis. Based on the topic modeling result, we design two methods to select hot topics and build links for them. (3)Keyword Extraction. Specially, we combine string frequency with syntax features and use language models to acquire candidate keywords for representing topics. (4)Visualization. Visualization demonstrates the quantifying properties of topics related to a certain event. A case study shows our framework achieves promising results on both single event and similar events. Copyright 2014 ACM.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Collective fast delivery by energy-efficient agents 43

Collective fast delivery by energy-efficient agents

引用

43rd International Symposium on Mathematical Foundations of computer science, MFCS 2018

作者： Bärtschi, Andreas Graf, Daniel Mihalák, Matúš Department of Computer Science ETH Zürich Switzerland Department of Data Science and Knowledge Engineering Maastricht University Netherlands

ISBN: (纸本)9783959770866

We consider k mobile agents initially located at distinct nodes of an undirected graph (on n nodes, with edge lengths). The agents have to deliver a single item from a given source node s to a given target node t. The agents can move along the edges of the graph, starting at time 0, with respect to the following: Each agent i has a weight ωi that defines the rate of energy consumption while travelling a distance in the graph, and a velocity υi with which it can move. We are interested in schedules (operating the k agents) that result in a small delivery time T (time when the item arrives at t), and small total energy consumption E. Concretely, we ask for a schedule that: either (i) Minimizes T , (ii) Minimizes lexicographically (T, E) (prioritizing fast delivery), or (iii) Minimizes · T + (1 − ) · E, for a given ∈ (0, 1). We show that (i) is solvable in polynomial time, and show that (ii) is polynomial-time solvable for uniform velocities and solvable in time O(n + k log k) for arbitrary velocities on paths, but in general is NP-hard even on planar graphs. As a corollary of our hardness result, (iii) is NP-hard, too. We show that there is a 2-approximation algorithm for (iii) using a single agent. © Andreas Bärtschi, Daniel Graf, and Matúš Mihalák.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Challenges for the multi-lingual, multi-dimensional personalised web

Challenges for the multi-lingual, multi-dimensional personal...

引用

1st Workshop on Personalised Multilingual Hypertext Retrieval, PMHR 2011, Held in Conjunction with the ACM Hypertext 2011, HT2011

作者： Wade, Vincent Centre for Next Generation Localisation Knowledge and Data Engineering Group School of Computer Science and Statistics Dublin 2 Ireland

ISBN: (纸本)9781450308977

The explosive growth of the Internet has seen it exceed over two billion users in 2010. However an analysis of the demography of this user base indicates an ever growing diversity. Currently only 38.8% of internet users originate from the countries such as Europe, America and Australia whereas 61.2% internet users come from the Africa, Asia and Middle East1. Moreover, these figures are changing even farther in favour of Africa, Asia and Middle East countries since their current internet penetration levels are relatively low e.g. the penetration of the internet in China/Asia is only at 21%, and Africa is only 10%. It is clear that the diversity of the user base of the web is growing rapidly. Moreover research is showing that each individual uses the WWW in different ways that suit their own personal needs, preferences. However, it is also clear that these differences extends far beyond just the appropriateness of content selection, and encompasses many dimensions e.g. tasks & activities, cultural preferences, language and social interaction etc. From a language diversity perspective, this growing diversity of internet users is increasingly apparent with English only accounting for 27% of all languages on the Internet in 2010. Other evidence of user diversity is demonstrated in social networking sites such as Facebook where in 2007 it supported 50M users in only one language (English) whilst by 2010 it had grown to 600M users and supported 77 different languages. By 2010 55% (approximately 13.75 Billion) tweets on Twitter were non-English. The expansion of the internet is not just in user number but has also resulted in vast quantities and great diversity of WWW accessible content where user generated content has for some time exceeded traditional web hosted content. In 2011, mobile access to the Internet and WWW has exceeded that accessed from desktop computers. Increasingly digital content on the internet is reaching users, not just through traditional web queries b

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Avoiding "big brother" anxiety with progressive self-management of ubiquitous computing services 5

Avoiding "big brother" anxiety with progressive self-managem...

引用

5th International ICST Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2008

作者： Feeney, Kevin Lewis, Dave McGlinn, Kris O'Sullivan, Declan Holohan, Anne Knowledge and Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Ireland Department of Sociology Trinity College Dublin Ireland

ISBN: (纸本)9789639799219

Despite the significant research over the last ten years, commercial ubiquitous computing environments and pervasive applications remain thin on the ground. This paper looks at the explosion in application creativity on the internet in recent years - the so-called web 2.0' - in order to identify the obstacles to application creativity in ubiquitous computing. Although technological and standardisation advances are progressively diminishing the scale of the technical problems in the domain, how to manage such applications in such a way so as to encourage user-acceptance remains an open question. It is a question that is particularly difficult due to the serious privacy concerns and the need for negotiated management of services between users due to physically embedded nature of sensor-driven applications. We describe a technical platform which is designed to allow users of ubiquitous computing environments to manage their own personal data and share it in a controlled way and describe an experimental programme to measure the relationship between users' perception of how much control they can exercise over their personal data and their acceptance of ubiquitous computing applications. Copyright © 2008 ICST.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Residual network with delayed max pooling for very large scale plant identification 18

Residual network with delayed max pooling for very large sca...

引用

18th Working Notes of CLEF Conference and Labs of the Evaluation Forum, CLEF 2017

作者： Hang, Siang Thye Aono, Masaki Knowledge Data Engineering and Information Retrieval Laboratory Department of Computer Science and Engineering Toyohashi University of Technology Japan

In our approach, we applied a few modifications to the 50-layered Residual Network. Our preliminary experiments with the Plant-CLEF 2016 dataset showed that the modifications improved classification performance. We have trained three models based on the modified Residual Network configuration with different combinations of trusted and noisy PlantCLEF 2017 datasets. Using confidence scores extracted from the three models, we have submitted four runs and our methods showed competitive classification performance.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Accumulated gradient normalization 9

Accumulated gradient normalization

引用

9th Asian Conference on Machine Learning, ACML 2017

作者： Hermans, Joeri R. Spanakis, Gerasimos Möckel, Rico Department of Electrical Engineering and Computer Science Liège University Belgium Department of Data Science and Knowledge Engineering Maastricht University Netherlands

This work addresses the instability in asynchronous data parallel optimization. It does so by introducing a novel distributed optimizer which is able to efficiently optimize a centralized model under communication constraints. The optimizer achieves this by pushing a normalized sequence of first-order gradients to a parameter server. This implies that the magnitude of a worker delta is smaller compared to an accumulated gradient, and provides a better direction towards a minimum compared to first-order gradients, which in turn also forces possible implicit momentum fluctuations to be more aligned since we make the assumption that all workers contribute towards a single minima. As a result, our approach mitigates the parameter staleness problem more effectively since staleness in asynchrony induces (implicit) momentum, and achieves a better convergence rate compared to other optimizers such as asynchronous easgd and dynsgd, which we show empirically. © 2017 J.R. Hermans, G. Spanakis & R. Möckel.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive tourism modeling and socialization system

Adaptive tourism modeling and socialization system

引用

2009 IEEE International Conference on Social Computing, SocialCom 2009

作者： Coelho, Bruno Martins, Constantino Almeida, Ana GECAD - Knowledge Engineering and Decision Support Group Computer Science Department Institute of Engineering Porto Portugal

ISBN: (纸本)9780769538235

This paper presents an undertaken research work about the development of an Adaptive Tourism Modeling System which attempts to correctly model a tourism web application user profile. This paper will follow the methodology used behind the concept of the application, 'User Modeling as a process', which consists of three specific modules in order to achieve a clear user modeling technology. The user representation module devises a collection of knowledge representation formalisms that co-exist in order to constitute the system's view of the user;the user reasoning module is responsible for the execution of several inference tasks as well as the generation of possibly new and valuable information about the user, using the latter module. The user concept that comes out of these two modules will ultimately be used by various kinds of application-level systems, namely a recommender system, therefore instantiating a project-dependent third module. © 2009 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Size-fixed group discovery via multi-constrained graph pattern matching

引用

Information sciences 2025年 690卷

作者： Guliu Liu Lei Li Guanfeng Liu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education 230601 Hefei China School of Computer Science and Information Engineering Hefei University of Technology 230601 Hefei China Department of Computing Macquarie University Sydney 2122 Australia

Multi-Constrained Graph Pattern Matching (MC-GPM) aims to match a pattern graph with multiple attribute constraints on its nodes and edges, and has garnered significant interest in various fields, including social-based e-commerce and trust-based group discovery. However, the existing MC-GPM methods do not consider situations where the number of each node in the pattern graph needs to be fixed, such as finding experts group with expert quantities and relations specified. In this paper, a Multi-Constrained Strong Simulation with the Fixed Number of Nodes (MCSS-FNN) matching model is proposed, and then a Trust-oriented Optimal Multi-constrained Path (TOMP) matching algorithm is designed for solving it. Additionally, two heuristic optimization strategies are designed, one for combinatorial testing and the other for edge matching, to enhance the efficiency of the TOMP algorithm. Empirical experiments are conducted on four real social network datasets, and the results demonstrate the effectiveness and efficiency of the proposed algorithm and optimization strategies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Computing Link-based Similarity in Real World Networks

Efficient Algorithm for Computing Link-based Similarity in R...

引用

9th IEEE International Conference on data Mining

作者： Cai, Yuanzhe Cong, Gao Jia, Xu Liu, Hongyan He, Jun Lu, Jiaheng Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Computer Science Aalborg University Denmark Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9781424452422

Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.

关键词： Similarity Calculation SimRank Graph Mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：