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

40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015

作者： Jin, Qin Li, Chengxin Chen, Shizhe Wu, Huimin Computer Science Department School of Information Renmin University of China Beijing China Key Lab of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China

ISBN: (纸本)9781467369978

In this paper we explore one of the key aspects in building an emotion recognition system: generating suitable feature representations. We generate feature representations from both acoustic and lexical levels. At the acoustic level, we first extract low-level features such as intensity, F0, jitter, shimmer and spectral contours etc. We then generate different acoustic feature representations based on these low-level features, including statistics over these features, a new representation derived from a set of low-level acoustic codewords, and a new representation from Gaussian Supervectors. At the lexical level, we propose a new feature representation named emotion vector (eVector). We also use the traditional Bag-of-Words (BoW) feature. We apply these feature representations for emotion recognition and compare their performance on the USC-IEMOCAP database. We also combine these different feature representations via early fusion and late fusion. Our experimental results show that late fusion of both acoustic and lexical features achieves four-class emotion recognition accuracy of 69.2%. © 2015 IEEE.

关键词： Acoustic features Emotion lexicon Emotion recognition Lexical features Support vector machine

来源：评论

学校读者我要写书评

暂无评论

#Metoomaastricht: Building a chatbot to assist survivors of sexual harassment

arXiv

引用

arXiv 2019年

作者： Bauer, Tobias Devrim, Emre Glazunov, Misha Jaramillo, William Lopez Mohan, Balaganesh Spanakis, Gerasimos Maastricht University Department of Data Science Knowledge Engineering

Inspired by the recent social movement of #MeToo, we are building a chatbot to assist survivors of sexual harassment cases (designed for the city of Maastricht but can easily be extended). The motivation behind this work is twofold: properly assist survivors of such events by directing them to appropriate institutions that can offer them help and increase the incident documentation so as to gather more data about harassment cases which are currently under reported. We break down the problem into three data science/machine learning components: harassment type identification (treated as a classification problem), spatio-temporal information extraction (treated as Named Entity Recognition problem) and dialogue with the users (treated as a slot-filling based chatbot). We are able to achieve a success rate of more than 98% for the identification of a harassment-or-not case and around 80% for the specific type harassement identification. Locations and dates are identified with more than 90% accuracy and time occurences prove more challenging with almost 80%. Finally, initial validation of the chatbot shows great potential for the further development and deployment of such a beneficial for the whole society tool. Copyright © 2019, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Enhancements for real-time Monte-Carlo Tree Search in General Video Game Playing

Enhancements for real-time Monte-Carlo Tree Search in Genera...

引用

IEEE Symposium on Computational Intelligence and Games, CIG

作者： Dennis J. N. J. Soemers Chiara F. Sironi Torsten Schuster Mark H. M. Winands Department of Data Science and Knowledge Engineering Maastricht University

ISBN: (纸本)9781509018840

General Video Game Playing (GVGP) is a field of Artificial Intelligence where agents play a variety of real-time video games that are unknown in advance. This limits the use of domain-specific heuristics. Monte-Carlo Tree Search (MCTS) is a search technique for game playing that does not rely on domain-specific knowledge. This paper discusses eight enhancements for MCTS in GVGP; Progressive History, N-Gram Selection Technique, Tree Reuse, Breadth-First Tree Initialization, Loss Avoidance, Novelty-Based Pruning, knowledge-Based Evaluations, and Deterministic Game Detection. Some of these are known from existing literature, and are either extended or introduced in the context of GVGP, and some are novel enhancements for MCTS. Most enhancements are shown to provide statistically significant increases in win percentages when applied individually. When combined, they increase the average win percentage over sixty different games from 31.0% to 48.4% in comparison to a vanilla MCTS implementation, approaching a level that is competitive with the best agents of the GVG-AI competition in 2015.

关键词： Games Monte Carlo methods History Real-time systems Silicon knowledge based systems Avatars

来源：评论

学校读者我要写书评

暂无评论

Efficient querying of correlated uncertain data with cached results

Efficient querying of correlated uncertain data with cached ...

引用

18th International Conference on database Systems for Advanced Applications, DASFAA 2013

作者： Chen, Jinchuan Zhang, Min Xie, Xike Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China School of Information Renmin University of China China Department of Computer Science Aalborg University Denmark

ISBN: (纸本)9783642374869

Although there have been many efforts for management of uncertain data, evaluating probabilistic inference queries, a known NP-hard problem, is still a big challenge, especially for querying data with highly correlations. The state-of-art exact algorithms for accelerating the evaluation of inference queries are based on special indices. Besides, with the observation of the existence of many frequent queries, some researchers try to improve efficiency by reusing previously queried results. Indexing depends on the static properties like data distributions, whereas caching is in favor of the dynamic features like query workload. In this paper we propose a new approach for speeding up the evaluation of inference queries by caching frequent results in a junction tree-based hierarchical index. To the best of our knowledge, this is the first effort on utilizing both the static (data) and dynamic (query workload) properties to efficiently evaluate probabilistic inference queries. Moreover, according to our experience, different caching strategies may significantly affect the query performance. Basically a good caching strategy needs to have high cache hit ratio with limited space *** on these considerations, we propose a novel caching approach, called FVEC, and present corresponding algorithms for efficiently querying correlated uncertain data. We further conduct a series of extensive experiments on large uncertain datasets in order to illustrate the effectiveness and efficiency of our proposed approaches. As illustrated by the results, compared with previous solutions, our method could greatly improve the query performance. © Springer-Verlag 2013.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

VAN: Vehicle-assisted shortest-time path navigation

VAN: Vehicle-assisted shortest-time path navigation

引用

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

作者： Chen, Wenping Zhu, Sencun Li, Deying School of Information Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China Department of Computer Science and Engineering Pennsylvania State University University Park PA United States

ISBN: (纸本)9781424474882

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 dynamic navigation protocol called VAN for individual vehicles to find the shortest-time paths toward their given destinations. Specifically, a vehicle initiates a number of queries, which are routed by VANETs along different paths toward its destination. During query forwarding, the real-time road traffic information in each road segment is aggregated from multiple participating vehicles and returned to the source after the query reaches the destination. This information enables the source to calculate the shortest-time path. We also propose two forwarding optimization methods to reduce communication costs and an error handling mechanism to deal with abnormal circumstances. To evaluate its performance, we use the real traffic data of Beijing, including 2,308 road segments at two different times. Our simulation results demonstrate that our protocol, on average, could save around 30% driving time, compared to traveling along the shortest distance paths. ©2010 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Health Care Expense Anticipation using Computational Intelligence 1

Performance Analysis of Health Care Expense Anticipation usi...

引用

1st International Conference on Innovative engineering sciences and Technological Research, ICIESTR 2024

作者： Gopalakrishnan, A. Kumarganesh, S. Divya Bharathi, G. Anthoniraj, S. Natarajan, Suresh Kumar Gochhait, Saikat Knowledge Institute of Technology Department of Artificial Intelligence and Data Science Salem India Knowledge Institute of Technology Department of Electronics and Communication Engineering Salem India Mahendra Institute of Technology Department of Computer Science and Engineering Namakkal India School of Computer Science and Engineering Ramanagara India Symbiosis International Deemed University Symbiosis Institute of Digital and Telecom Management Maharashtra Pune India

ISBN: (纸本)9798350348637

The escalating costs of healthcare globally necessitate the development of accurate prediction models to address the financial strain on individuals, families, businesses, and governments. This research employs linear regression models to forecast healthcare expenditures, analyzing the intricate relationship between various factors and costs. A comprehensive literature survey explores topics such as the impact of environmental pollution on healthcare spending, prediction of surgical expenses, budget impact analysis for cancer treatment, and the integration of big data in healthcare infrastructure investments. The methodology involves gathering a diverse dataset encompassing patient demographics, medical history, treatment methods, and associated expenditures. Exploratory data analysis employs Pearson's correlation coefficient to identify trends and correlations between variables. Two linear regression models are proposed and compared, with the second model excluding non-significant variables for enhanced accuracy and interpretability. Results indicate that the second model, with refined feature selection, outperforms the first in terms of mean squared error and R-squared values. A comparative analysis of different studies underscores the diverse findings in healthcare economics, ranging from the impact of CO2 emissions on health to predicting surgery costs and budgetary savings in cancer treatment. The research contributes to the growing body of knowledge in healthcare economics, providing decision-makers with a valuable tool for precise expenditure estimation. The emphasis on linear regression models aids stakeholders in understanding factors influencing healthcare costs, guiding resource allocation, policy creation, and financial planning for more sustainable and effective healthcare systems. © 2024 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

From subjects to concept clouds-Why semantic mapping is necessary

From subjects to concept clouds-Why semantic mapping is nece...

引用

1st International Workshop on knowledge Federation 2008

作者： Thomas, Hendrik Markscheffel, Bernd Redmann, Tobias Department of Information-and Knowledge Management TechnischeUniversität Ilmenau P.O. Box 100565 98693 Ilmenau Germany Knowledge / Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Ireland

To realize the vision of the semantic web it is essential to be able to exchange formal modeled knowledge between applications and humans without loss of meaning. In this paper, we focus on questions relating to meaning, interpretation and subject identity in modern semantic web languages. Based on the semiotic triangle we show that topics as well as RDF resources are symbols, representing concepts and not referents as the common term "subject" would indicate. A subject can not be represented as a single entity, but rather as a complex and evolving system of different concepts. Based on this insight we explain how the resulting plurality and uncertainness of the interpretation of symbols can be handled using semantic mappings. By defining transformation rules, the exchange and integration of knowledge from different semantic models becomes possible. Concluding we define recommendations and design guidelines for a semantic mapping management system, which is needed to support users and applications in creating, reusing, managing and applying such semantic mappings.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

HUSS:A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

引用

data Intelligence 2023年第3期5卷 537-559页

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S.Sheng Key Laboratory of Knowledge Engineering with Big Data(the Ministry of Education of China) Hefei University of TechnologyChinaSchool of Computer Science and Information EngineeringHefei University of TechnologyHefeiChina Research Institute of Artificial Intelligence Zhejiang LabHangzhouChina Department of Computer Science Texas Tech UniversityLubbockTX 79409USA

Spreadsheets contain a lot of valuable data and have many practical *** key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets,e.g.,identifying cell function types and discovering relationships between cell *** existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells.A few studies do,but they ignore the layout structure information of spreadsheets,which affects the performance of cell function classification and the discovery of different relationship types of cell *** this paper,we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets(HUSS).Specifically,for improving the cell function classification,we propose an error correction mechanism(ECM)based on an existing cell function classification model[11]and the layout features of *** improving the table structure analysis,we propose five types of heuristic rules to extract four different types of cell pairs,based on the cell style and spatial location *** experimental results on five real-world datasets demonstrate that HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Spreadsheet semantic structure Information extraction Heuristics Cell function analysis Table structure analysis

来源：评论

学校读者我要写书评

暂无评论

Enhancing Playout Policy Adaptation for General Game Playing 1

引用

1st Workshop on Monte Carlo Search, MCS 2020, Held in conjunction with IJCAI 2020

作者： Sironi, Chiara F. Cazenave, Tristan Winands, Mark H. M. Game AI & Search Group Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands LAMSADE Université Paris-Dauphine PSL CNRS Paris France

ISBN: (数字)9783030894535

ISBN: (纸本)9783030894528

Playout Policy Adaptation (PPA) is a state-of-the-art strategy that has been proposed to control the playouts in Monte-Carlo Tree Search (MCTS). PPA has been successfully applied to many two-player, sequential-move games. This paper further evaluates this strategy in General Game Playing (GGP) by first reformulating it for simultaneous-move games. Next, it presents five enhancements for the strategy, four of which have been previously successfully applied to a related MCTS playout strategy, the Move-Average Sampling Technique (MAST). Experiments on a heterogeneous set of games show three enhancements to have a positive effect on PPA: (i) updating the policy for all players proportionally to their payoffs instead of updating only the policy of the winner, (ii) collecting statistics for N-grams of moves instead of single moves only, and (iii) discounting the backpropagated payoffs depending on the depth of the playout. Results also show enhanced PPA variants to be competitive with MAST for small search budgets, and better for larger search budgets. The use of an ϵ -greedy selection of moves and of after-move decay of statistics, instead, seem to have a detrimental effect on PPA. © 2021, Springer Nature Switzerland AG.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Dynamics of Ventricular Electrophysiology Are Unmasked Through Noninvasive Electrocardiographic Imaging

Dynamics of Ventricular Electrophysiology Are Unmasked Throu...

引用

2021 Computing in Cardiology, CinC 2021

作者： Stoks, Job Van Rees, Bianca Nguyen, Uyen Chau Peeters, Ralf Volders, Paul Ga Cluitmans, Matthijs Maastricht University Medical Center Department of Cardiology Maastricht Netherlands Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands BIOMED Hasselt University Hasselt Belgium

ISBN: (纸本)9781665479165

Dynamic variability of ventricular activation and recovery can be a physiological phenomenon, but is also known to increase susceptibility to arrhythmias. It has been extensively studied on the 12-lead electrocardiogram (ECG), but subtle (patho)physiological variations may be challenging to detect and localize due to the limited spatial resolution. Electrocardiographic imaging (ECGI) could be a useful noninvasive high-resolution mapping technique to investigate ventricular dynamics in more detail. Ventricular activation and recovery times (ATs and RTs) were examined using ECGI in 10 normal subjects. Zero-th order Tikhonov regularization was used in combination with a spatiotemporal estimation method to determine ATs and RTs. Dynamics were defined as standard deviations of ventricular ATs and RTs over three beats. Dynamics were higher for recovery than for activation during sinus rhythm, and significantly exaggerated after ventricular ectopy. Left ventricular areas were less dynamic than right ventricular areas. Since arrhythmias may arise due to an increase in ventricular dynamics in the diseased heart, these results provide an important basis for future research on ventricular dynamics and arrhythmias. © 2021 Creative Commons.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：