发布求助
文献互助 智能选刊 最新文献

2018 6th International Symposium on Computational and Business Intelligence (ISCBI)最新文献

筛选
英文 中文
Time and Cost Dependent TSP Problem: An Experimentation System for the Practical Users 时间与成本相关的TSP问题:一个面向实际用户的实验系统
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00012
Adrian Strugala, L. Koszalka, I. Pozniak-Koszalka, A. Kasprzak
{"title":"Time and Cost Dependent TSP Problem: An Experimentation System for the Practical Users","authors":"Adrian Strugala, L. Koszalka, I. Pozniak-Koszalka, A. Kasprzak","doi":"10.1109/ISCBI.2018.00012","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00012","url":null,"abstract":"The paper presents various approaches to finding the optimal solution for a problem, which is an extension of the classical travelling salesmen problem (TSP). The problem consists in choosing the route between two distinct towns: starting and target, when there are available not only free standard roads but toll highway, either. The four variants of the problem and three heuristic algorithms solving the formulated problems are under consideration. In the paper is presented the designed and implemented experimentation system which gives opportunities for finding the best route by the practical users. Moreover, this system allows making simulation experiments. On the basis of the obtained results of such experiments the comparative analysis of the algorithms and of the considered variants have been made showing that the proposed approaches seems to be promising.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130953723","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
Evaluation of the Dirichlet Process Multinomial Mixture Model for Short-Text Topic Modeling Dirichlet过程多项混合模型在短文本主题建模中的评价
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00025
Alexander Karlsson, Denio Duarte, G. Mathiason, Juhee Bae
{"title":"Evaluation of the Dirichlet Process Multinomial Mixture Model for Short-Text Topic Modeling","authors":"Alexander Karlsson, Denio Duarte, G. Mathiason, Juhee Bae","doi":"10.1109/ISCBI.2018.00025","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00025","url":null,"abstract":"Fast-moving trends, both in society and in highly competitive business areas, call for effective methods for automatic analysis. The availability of fast-moving sources in the form of short texts, such as social media and blogs, allows aggregation from a vast number of text sources, for an up to date view of trends and business insights. Topic modeling is established as an approach for analysis of large amounts of texts, but the scarcity of statistical information in short texts is considered to be a major problem for obtaining reliable topics from traditional models such as LDA. A range of different specialized topic models have been proposed, but a majority of these approaches rely on rather strong parametric assumptions, such as setting a fixed number of topics. In contrast, recent advances in the field of Bayesian non-parametrics suggest the Dirichlet process as a method that, given certain hyper-parameters, can self-adapt to the number of topics of the data at hand. We perform an empirical evaluation of the Dirichlet process multinomial (unigram) mixture model against several parametric topic models, initialized with different number of topics. The resulting models are evaluated, using both direct and indirect measures that have been found to correlate well with human topic rankings. We show that the Dirichlet Process Multinomial Mixture model is a viable option for short text topic modeling since it on average performs better, or nearly as good, compared to the parametric alternatives, while reducing parameter setting requirements and thereby eliminates the need of expensive preprocessing.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133166871","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
Short Text Topic Modeling to Identify Trends on Wearable Bio-Sensors in Different Media Type 短文本主题建模识别可穿戴生物传感器在不同媒体类型中的趋势
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00027
Juhee Bae, Jesper Havsol, M. Karpefors, Alexander Karlsson, G. Mathiason
{"title":"Short Text Topic Modeling to Identify Trends on Wearable Bio-Sensors in Different Media Type","authors":"Juhee Bae, Jesper Havsol, M. Karpefors, Alexander Karlsson, G. Mathiason","doi":"10.1109/ISCBI.2018.00027","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00027","url":null,"abstract":"The technology and techniques for bio-sensors are rapidly evolving. Accordingly, there is significant business interest to identify upcoming technologies and new targets for the near future. Text information from internet reflects much of the recent information and public interests that help to understand the trend of a certain field. Thus, we utilize Dirichlet process topic modeling on different media sources containing short text (e.g., blogs, news) which is able to self-adapt the learned topic space to the data. We share the observations from the domain experts on the results derived from topic modeling on wearable biosensors from multiple media sources over more than eight years. We analyze the topics on wearable devices, forecast and market analysis, and bio-sensing techniques found from our method.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115707045","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
Pathfinding Optimization when Solving the Paparazzi Problem Comparing A* and Dijkstra's Algorithm 比较A*和Dijkstra算法求解狗仔队问题的寻路优化
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00014
Shama Baldi, Nina Maric, Rolf Dornberger, T. Hanne
{"title":"Pathfinding Optimization when Solving the Paparazzi Problem Comparing A* and Dijkstra's Algorithm","authors":"Shama Baldi, Nina Maric, Rolf Dornberger, T. Hanne","doi":"10.1109/ISCBI.2018.00014","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00014","url":null,"abstract":"This paper aims to compare the application of the A* algorithm and Dijkstra's algorithm to solve a particular variant of pathfinding problem based on the so-called paparazzi problem. The problem consists of a grid with different fixed obstacles, leading to different traversing time factors respectively costs. A specific model of this problem is derived and the performance of these two pathfinding algorithms that solve the paparazzi problem is compared with regard to the computation time and the number of iterations. The shortest versus the fastest path with lowest cost are discussed.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127355630","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}
引用次数: 8
Invited Speaker 邀请演讲者
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/iscbi.2018.00010
{"title":"Invited Speaker","authors":"","doi":"10.1109/iscbi.2018.00010","DOIUrl":"https://doi.org/10.1109/iscbi.2018.00010","url":null,"abstract":"","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"61 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132513001","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}
引用次数: 16
Optimality in Vector Spaces 向量空间中的最优性
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00011
V. Postolica
{"title":"Optimality in Vector Spaces","authors":"V. Postolica","doi":"10.1109/ISCBI.2018.00011","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00011","url":null,"abstract":"This research work is devoted to the general Optimaliy presented inside the best appropriate environment of the Infinite Dimensional Ordered Vector Spaces, with its natural projections in the Vectorial Optimization. It is also a short but original scientific Survey on the Efficiency by the Optimality and conversely, in the most general context of the Ordered Vector Spaces, the foundations for the Computational and Business Intelligence. Following our refined recent results we suggest new links between the General Efficiency, the Vector and Strong Optimization and the Potential Theory in order to continue the development for the next fields of the Scientific Research: Theory and Applications of the Generalized Dynamical Systems, Fixed points Theory, Choquet Boundaries, the Best Approximation Theory, the study of the Conically Bounded Sets, the study of the Nuclearity for the Topological Vector Spaces, Vector Optimization for multivalued functions and so on together with pertinent Applications.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132489957","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
Multilingual Sentiment Analysis for a Swiss Gig 瑞士演出的多语言情感分析
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/iscbi.2018.00028
Ela Pustulka-Hunt, T. Hanne, Eliane Blumer, Manuel Frieder
{"title":"Multilingual Sentiment Analysis for a Swiss Gig","authors":"Ela Pustulka-Hunt, T. Hanne, Eliane Blumer, Manuel Frieder","doi":"10.1109/iscbi.2018.00028","DOIUrl":"https://doi.org/10.1109/iscbi.2018.00028","url":null,"abstract":"We are developing a multilingual sentiment analysis solution for a Swiss human resource company working in the gig sector. To examine the feasibility of using machine learning in this context, we carried out three sentiment assignment experiments. As test data we use 963 hand annotated comments made by workers and their employers. Our baseline, machine learning (ML) on Twitter, had an accuracy of 0.77 with the Matthews correlation coefficient (MCC) of 0.32. A hybrid solution, Semantria from Lexalytics, had an accuracy of 0.8 with MCC of 0.42, while a tenfold cross-validation on the gig data yielded the accuracy of 0.87, F1 score 0.91, and MCC 0.65. Our solution did not require language assignment or stemming and used standard ML software. This shows that with more training data and some feature engineering, an industrial strength solution to this problem should be possible.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132500540","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}
引用次数: 6
Title Page i 第1页
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/iscbi.2018.00001
{"title":"Title Page i","authors":"","doi":"10.1109/iscbi.2018.00001","DOIUrl":"https://doi.org/10.1109/iscbi.2018.00001","url":null,"abstract":"","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132761563","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
A Novel Virtual Machine Selection Policy for Virtual Machine Consolidation 一种新的虚拟机整合选择策略
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00016
M. Sohrabi, V. Ghods, Seyed Yahya Zahedi Fard
{"title":"A Novel Virtual Machine Selection Policy for Virtual Machine Consolidation","authors":"M. Sohrabi, V. Ghods, Seyed Yahya Zahedi Fard","doi":"10.1109/ISCBI.2018.00016","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00016","url":null,"abstract":"Cloud computing has been focused by a wide range of researches and organizational considerations. One of the most important challenges in this area is to reduce the energy consumption of cloud data centers. Virtualization, which is one of the key features of the machine consolidation technique, is a major step to improve the energy consumption and resource management in this area. Selection of appropriate virtual machines for migration and consolidating them on fewer servers is one of the challenges of virtual machine consolidation process. In this paper, a new approach is introduced to distribute migrations among different categories of virtual machines based on their importance in order to improve the cloud services. By introducing a matrix of virtual machines and their migration rates, the proposed method of this paper has reduced the migration of virtual machines to reduce their service level agreement (SLA). The results of the research are evaluated using the CloudSim simulator and the validity of the assumptions is proved experimentally.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124187635","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
Farsi Handwriting Digit Recognition Based on Convolutional Neural Networks 基于卷积神经网络的波斯语手写数字识别
2018 6th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2018-08-01 DOI: 10.1109/ISCBI.2018.00022
A. Dehghanian, V. Ghods
{"title":"Farsi Handwriting Digit Recognition Based on Convolutional Neural Networks","authors":"A. Dehghanian, V. Ghods","doi":"10.1109/ISCBI.2018.00022","DOIUrl":"https://doi.org/10.1109/ISCBI.2018.00022","url":null,"abstract":"In this paper, a convolutional neural network (CNN) is exploited for Farsi handwritten digit recognition. For training and evaluating the CNN, the \"HODA\" dataset was used which consists of 80000 images of Farsi handwritten digits. In the proposed method, we focused on the efficient and unique feature of Farsi digits that is using just the half upper part of the digits for recognition purpose. The proposed method, despite of a 50% reduction in the data size which fed to the CNN, yielded an acceptable reduction in time consuming for training and evaluate CNN of about 50 % compared when using the full image of the digits (full data), and just a 1.5% increase in recognition error.","PeriodicalId":153800,"journal":{"name":"2018 6th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132354624","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术官方微信