2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)最新文献

筛选
英文 中文
Boosting Few-Shot Image Recognition Via Domain Alignment Prototypical Networks 基于域对齐原型网络的少量图像识别
Jiang Lu, Zhong Cao, Kailun Wu, Gang Zhang, Changshui Zhang
{"title":"Boosting Few-Shot Image Recognition Via Domain Alignment Prototypical Networks","authors":"Jiang Lu, Zhong Cao, Kailun Wu, Gang Zhang, Changshui Zhang","doi":"10.1109/ICTAI.2018.00048","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00048","url":null,"abstract":"Human has the ability of drawing inferences about other things from only one instance. Few-shot learning is aimed at imitating this generalized learning behavior of human beings, where the learning machine is expected to recognize novel categories not seen in the training set, given only a few training data for each novel category. In this paper, we enhance the Prototypical Network for few-shot learning tasks by introducing a domain alignment module, which takes into account the domain shifts existing between different categories. Compared to original Prototypical Network (PN), the most excellent model for few-shot learning at present, our proposed Domain Alignment Prototypical Network (DA-PN) is able to abate the distribution differences among the data of training and test classes, further optimizing the embedding space of prototype feature for each category and then boosting few-shot recognition. Comprehensive empirical evidence demonstrates that the proposed DA-PN can yield state-of-the-art few-shot recognition performance on the public benchmark dataset mini-ImageNet as well as a novel proposed few-shot dataset MNIST&CIFAR10.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125166985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Building and Interpreting Risk Models from Imbalanced Clinical Data 从不平衡的临床数据中建立和解释风险模型
Aaron N. Richter, T. Khoshgoftaar
{"title":"Building and Interpreting Risk Models from Imbalanced Clinical Data","authors":"Aaron N. Richter, T. Khoshgoftaar","doi":"10.1109/ICTAI.2018.00031","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00031","url":null,"abstract":"As more clinical data becomes available for research, it is important to be able to build effective models and understand the predictions made from them. In this paper, we present a case study modeling melanoma risk using structured clinical records. Advanced modeling techniques are required as the data set is large, sparse, and imbalanced. We explore the use of logistic regression, decision tree, and random forest classifiers with various feature selection and random undersampling techniques. For clinical models to be used in practice, both providers and patients should have insight into why a certain prediction is made. Therefore, interpretability must be a key factor when choosing a model for a clinical prediction task, and we explore the level of interpretation given by the models compared to their predictive performance.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124330123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Object Detection with Neural Models, Deep Learning and Common Sense to Aid Smart Mobility 利用神经模型、深度学习和常识进行目标检测,帮助智能移动
Abidha Pandey, Manish Puri, A. Varde
{"title":"Object Detection with Neural Models, Deep Learning and Common Sense to Aid Smart Mobility","authors":"Abidha Pandey, Manish Puri, A. Varde","doi":"10.1109/ICTAI.2018.00134","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00134","url":null,"abstract":"The advent of autonomous transportation systems is attracting attention in AI today. Despite how far this area has progressed, there are situations better handled by humans. One of these is distinguishing objects seen for the first time and making decisions accordingly. Hence, our focus in this paper is on object detection, which can potentially enhance autonomous driving and other types of automation in transportation systems. This impacts Smart Mobility in Smart Cities. We provide expanded analysis of recent object detection techniques including neural models, deep learning and related advances. We highlight a novel object detection system called YOLO (You Only Look Once) and conduct its performance evaluation on real-time data. We point out challenges in this field and then explore the use of Commonsense Knowledge (CSK) in object detection with neural models and deep learning, emphasizing the importance of CSK to capture intuitive human reasoning. We explain how this work would potentially enhance autonomous vehicles and transportation systems. This work thus constitutes an exploratory paper that embodies a vision in Smart Mobility.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124452472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Social Recommendation Based on Implicit Friends Discovering Via Meta-Path 基于元路径内隐好友发现的社交推荐
Yuqi Song, Min Gao, Junliang Yu, Qingyu Xiong
{"title":"Social Recommendation Based on Implicit Friends Discovering Via Meta-Path","authors":"Yuqi Song, Min Gao, Junliang Yu, Qingyu Xiong","doi":"10.1109/ICTAI.2018.00039","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00039","url":null,"abstract":"With the growing popularity of online social platforms, it has been universally recognized that incorporating social relations into recommender systems can usually alleviate the problem of data sparsity. However, social recommender systems based on explicit relations are not as successful as expected due to the noise and the social cold issue of explicit social links. The intuition of utilizing explicit relations is that users share similar preferences if they are friends in the social network. In fact, quite a lot of users who are distant from each other in the social network also have similar tastes. The user item network and the user social network can provide useful information that can complement each other, so that exploring the implicit friends using the heterogeneous network they formed would be more helpful. In this paper, we propose an approach IFSR to discover implicit friends over the heterogeneous network to improve the performance of social recommendation. To find out reliable implicit ties, we first model the system as a heterogeneous network upon which both the preferences and social information are coupled. Over the HIN, similarities between each pair of users can be quantified through network embedding based representation learning. To reduce the computational cost while preserving the information embedded in the original networks and uncover the latent information hiding in the HIN, several meaningful meta-paths over the HIN are designed to guide the process of random walks. Finally, the Top-K implicit friends are incorporated into a social bayesian ranking model to enhance the performance of item ranking. Experimental results on three datasets demonstrate IFSR outperforms the state-of-the-art methods and illustrate why the implicit friends are advantageous for social recommendation.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"75 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123216388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A Stock-Movement Aware Approach for Discovering Investors' Personalized Preferences in Stock Markets 股票市场中投资者个性化偏好的股票运动感知方法
Jun Chang, Wenting Tu
{"title":"A Stock-Movement Aware Approach for Discovering Investors' Personalized Preferences in Stock Markets","authors":"Jun Chang, Wenting Tu","doi":"10.1109/ICTAI.2018.00051","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00051","url":null,"abstract":"It is very useful to endow machines with the ability to understand users' personalized preferences. In this paper, we propose a novel methodology for discovering investors' personalized preferences in stock markets. Our work is able to estimate investors' personalized preferences for each stock and thus helpful for realizing investment recommendation, for instance through recommending real-time news or others' opinions on stocks preferred by the target user. Compared to conventional approaches, our method effectively incorporates stock movements for estimating investors' preference. By capturing stock-movement patterns influencing users' preferences, our method can find users with a similar investment philosophy and then increase the effect of preference prediction. An experimental evaluation with two real-world datasets demonstrates the effectiveness of our approach.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123224384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Adaptive Give-Up Decisions for a Team of Robots Foraging with Task Partitioning 任务划分下机器人觅食团队的自适应放弃决策
J. Nogales, G. Oliveira
{"title":"Adaptive Give-Up Decisions for a Team of Robots Foraging with Task Partitioning","authors":"J. Nogales, G. Oliveira","doi":"10.1109/ICTAI.2018.00075","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00075","url":null,"abstract":"This work considers a team of robots foraging in a dynamic environment. The arena is divided into source and nest regions. Robots must transport objects from a source to a nest having two ways to complete this task: partitioning and non-partitioning. When partitioning, a robot carries the object until an area for transference while another robot may pick it up later to carry it to a nest. The non-partitioning option uses an alternative path that allows robots traveling back and forth between the regions. Robot decisions are based on experienced time to complete the transportation. Robots look for the faster option. We proposed two decision-making models: M-SGU (model for Static give up function) and M-AGU (model for adaptive give up function). M-AGU allows adaptation while robots forage and delivered the most promising results. We changed the delay to transfer an object to reproduce dynamic conditions that could be faced in real environments. Due to these changeable conditions, robots have to consider whether to abandon or struggle to complete the current task. The proposed decision-making strategies use a new adaptive give up function to make robots decide considering costs on both options and mixing old and new information. Simulation results show that robots reach faster adaptations leading to more objects successfully transported when using the proposed M-AGU strategy, which is also scalable to larger teams.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121116067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Online Single Homogeneous Source Transfer Learning Based on AdaBoost 基于AdaBoost的在线单同质源迁移学习
Chen Qian, Heng-yang Lu, Chong-Jun Wang
{"title":"Online Single Homogeneous Source Transfer Learning Based on AdaBoost","authors":"Chen Qian, Heng-yang Lu, Chong-Jun Wang","doi":"10.1109/ICTAI.2018.00061","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00061","url":null,"abstract":"Transfer learning has made great achievements in many fields and many excellent algorithms have been proposed. In recent years, many scholars have focused on a new research area called online transfer learning, which is different from general transfer learning. Online transfer learning concentrates on how to build a good classifier on the target domain when the training data arrive in an online/sequential manner. This paper focuses on online transfer learning problem based on a single source domain under homogeneous space. The existing algorithms HomOTL-I and HomOTL-II simply ensemble the classifiers on the source and target domains directly. When the distribution difference between the source domain and the target domain is large, it will not result in a good transfer effect. We are inspired by the idea of the boosting algorithm, that is we could form a strong classification model by a combination of multiple weak classifications. We train multiple classifiers on the source domain in an offline manner using AdaBoost algorithm, combine these classifiers on source domain with the classifier trained in an online manner on the target domain to form multiple weak combination in an ensemble manner. Based on the above ideas, we propose two algorithms AB-HomOTL-I and AB-HomOTLII, which have different ways to adjust the weights. We tested our algorithms on sentiment analysis dataset and 20newsgroup dataset. The results show that our algorithms are superior to other baseline algorithms","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132744051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Plan and Goal Recognition as HTN Planning 计划和目标识别作为HTN计划
D. Höller, P. Bercher, G. Behnke, Susanne Biundo-Stephan
{"title":"Plan and Goal Recognition as HTN Planning","authors":"D. Höller, P. Bercher, G. Behnke, Susanne Biundo-Stephan","doi":"10.1109/ICTAI.2018.00078","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00078","url":null,"abstract":"Plan-and Goal Recognition (PGR) is the task of inferring the goals and plans of an agent based on its actions. Traditional approaches in PGR are based on a plan library including pairs of plans and corresponding goals. In recent years, the field successfully exploited the performance of planning systems for PGR. The main benefits are the presence of efficient solvers and well-established, compact formalisms for behavior representation. However, the expressivity of the STRIPS planning models used so far is limited, and models in PGR are often structured in a hierarchical way. We present the approach Plan and Goal Recognition as HTN Planning that combines the expressive but still compact grammar-like HTN representation with the advantage of using unmodified, off-the-shelf planning systems for PGR. Our evaluation shows that - using our approach - current planning systems are able to handle large models with thousands of possible goals, that the approach results in high recognition rates, and that it works even when the environment is partially observable, i.e., if the observer might miss observations.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134043340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 34
An Improved Laplacian Semi-Supervised Regression 一种改进的拉普拉斯半监督回归
V. Kraus, Seif-Eddine Benkabou, K. Benabdeslem, F. Cherqui
{"title":"An Improved Laplacian Semi-Supervised Regression","authors":"V. Kraus, Seif-Eddine Benkabou, K. Benabdeslem, F. Cherqui","doi":"10.1109/ICTAI.2018.00092","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00092","url":null,"abstract":"In this paper, we present an improved approach for semi-supervised regression problems. Our proposal is based on both, the use of the top eigen functions of integral operator derived from both labeled and unlabeled examples as the basis functions; and the learning of the prediction function by a Laplacian regularized regression. We compare our method with some representative ones dealing with semi-supervised regression. This comparison is done over several public data sets. We also verify the effectiveness of the proposed algorithm to reconstitute the installation date of the pipes of the Lyon Metropolis sewer network.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132777734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A General Framework for Querying Possibilistic RDF Data 查询可能性RDF数据的通用框架
Amna Abidi, Mohamed Anis Bach Tobji, A. Hadjali, B. B. Yaghlane
{"title":"A General Framework for Querying Possibilistic RDF Data","authors":"Amna Abidi, Mohamed Anis Bach Tobji, A. Hadjali, B. B. Yaghlane","doi":"10.1109/ICTAI.2018.00033","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00033","url":null,"abstract":"Data on the Web is often pervaded with uncertainty. This is due to the openness of the Web and variety of sources which makes reliability of collected data questionable. In this paper, we address the Resource Description Framework (RDF) data uncertainty problem. Uncertainty here is represented by the rich possibility theory. To this end, we describe a general framework for supporting SPARQL-like queries on possibilistic RDF data, that we denote Pi-SPARQL. To describe possibilistic requirements, Pi-SPARQL extends SPARQL in the following two ways. First, it allows expressing possibility degrees to RDF based applications in an easy manner by associating the solutions for graph patterns with possibility measures. Then, Pi-SPARQL proposes appropriate semantics of the solution mappings and evaluation, i.e., it enables users to deal with uncertain RDF data specifications and access the possibility measures associated to the solutions.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132563871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信