2016 4th International Symposium on Computational and Business Intelligence (ISCBI)最新文献

筛选
英文 中文
Traffic condition estimation for delivery planning in city logistics 城市物流配送规划中的交通状况估计
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743262
Teng Suyan, Liu Zhengjie, L. Shubin
{"title":"Traffic condition estimation for delivery planning in city logistics","authors":"Teng Suyan, Liu Zhengjie, L. Shubin","doi":"10.1109/ISCBI.2016.7743262","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743262","url":null,"abstract":"In classical Vehicle Routing Problem, algorithms are developed based on travel distance or travel time estimated from an assumed constant travel speed. However, in city logistics, due to a growing amount of traffic and a limited capacity of the road network, travel speed between two locations no longer remains a constant but location and time dependent. In this paper, we propose a framework to visualize the traffic condition at different times and different locations of Singapore through estimating the travel speed between any two locations based on Google traffic data. We first divide Singapore into zones according to the Postal Code System. Then travel speeds within and between zones are estimated by randomly sampling pairs of locations and calculating the travel speed between them. The sample size, estimation accuracy, relationship between average and standard deviation of travel speed and travel distance are studied in details.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124885012","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 distance-based pareto evolutionary algorithm based on SPEA for combinatorial problems 组合问题的一种基于SPEA的距离pareto进化算法
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743268
Philippe Schadler, Juan David Berdugo, T. Hanne, Rolf Dornberger
{"title":"A distance-based pareto evolutionary algorithm based on SPEA for combinatorial problems","authors":"Philippe Schadler, Juan David Berdugo, T. Hanne, Rolf Dornberger","doi":"10.1109/ISCBI.2016.7743268","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743268","url":null,"abstract":"In 1999, the so-called Strength Pareto Evolutionary Algorithm (SPEA) was introduced to find a set of approximate Pareto efficient solutions. SPEA uses a correction method for handling the constraints of combinatorial problems, resulting in an interruption of the evolutionary process. In this paper, we present an extension of the original algorithm, which keeps infeasible solutions in the population, avoiding a slowdown of the evolutionary process. The former correction method is thus no longer required. The resulting DPEA (distance-based Pareto evolutionary algorithm) uses a modified fitness function based on the Euclidean distance to the closest solutions in the Pareto front. The functionality of DPEA and its implementation are discussed. As a first result, DPEA performs better than SPEA on optimizing knapsacks with weaker constraints (knapsacks with a higher capacity).","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134011780","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}
引用次数: 5
A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem 求解两梯队车辆路径问题的启发式比较框架
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743259
Xavier Butty, Thomas Stuber, T. Hanne, Rolf Dornberger
{"title":"A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem","authors":"Xavier Butty, Thomas Stuber, T. Hanne, Rolf Dornberger","doi":"10.1109/ISCBI.2016.7743259","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743259","url":null,"abstract":"The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in transport logistics with a two layered composition. In a first level trip, freight has to be delivered from a main depot to a set of possible satellites (intermediate depots). Afterwards the goods are served in second level trips to the final customers. Inspired by a paper from Nguyen, Prins and Prodhon we developed a novel heuristic comparison framework based on the open source simulation environment OpenCI. On the basis of the mentioned paper we implemented three heuristics to solve the 2E-VRP and a greedy randomized adaptive search procedure (GRASP) with a learning process (LP). The GRASP-LP uses two heuristics which improve their solution by a variable neighborhood descent (VND). The VND itself uses two different neighborhoods to enhance the result. The comparison framework is able to load different 2E-VRP maps which can be solved by single heuristics or the GRASP. The new heuristic comparison framework offers the possibility to add quickly different heuristics and to do experiments with them.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122509095","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
Recognition of online Farsi handwriting based on freeman chain code using hidden Markov model 基于隐马尔可夫模型的freeman链码在线波斯语手写识别
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743282
V. Ghods, M. Sohrabi, S. Hosseini
{"title":"Recognition of online Farsi handwriting based on freeman chain code using hidden Markov model","authors":"V. Ghods, M. Sohrabi, S. Hosseini","doi":"10.1109/ISCBI.2016.7743282","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743282","url":null,"abstract":"This paper attempts to recognize online Farsi handwriting using the freeman chain codes and hidden Markov model. Chain codes reduce the number of data with using the direction of breaks and keeping the direction of pen movement. Hence, it can be used as an effective way to recognition of online sub-words. After breaking the sub-word into component parts (main body and strokes), each part separately codes using freeman chain code. Since these codes are not sufficient to recognize of sub-words, they were merged with some other features extracted from horizontal and vertical trajectories. Finally, the set of features was classified by hidden Markov model. Modeling has built with Baum-Welch algorithm and training of the samples performed with forward algorithms. Using the mentioned steps on a database including the 2000 sub-words has the recognition rate of %93.5.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116423998","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
Multiclass common spatial pattern with artifacts removal methodology for EEG signals 脑电信号的多类公共空间模式及伪影去除方法
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743264
Hardik Meisheri, N. Ramrao, S. Mitra
{"title":"Multiclass common spatial pattern with artifacts removal methodology for EEG signals","authors":"Hardik Meisheri, N. Ramrao, S. Mitra","doi":"10.1109/ISCBI.2016.7743264","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743264","url":null,"abstract":"Common Spatial Pattern (SP) algorithm has been proved to be effective in Brain Computer Interface (BCI) for extracting features from Electroencephalogram (EEG) signals used in motor imagery tasks, but it is vulnerable to noise and the problem of over-fitting. Many algorithms have been devised to regularize CSP for two class problem, however they have not been effective when applied to multiclass CSP. The features extracted using the CSP are non-stationary in nature which increases the difficulty during classification. We propose a method to remove trials that are affected by noise before calculating the CSP. This helps in calculating eigenvectors which generates better CSP. To handle the non-stationarity in the EEG signal, Self-Regulated Interval Type-2 Neuro-Fuzzy Inference System (SRIT2NFIS) was proposed in the literature for two class EEG classification problem. This paper extends the SRIT2NFIS to Multiclass CSP using Joint Approximate Diagonalization (JAD). The results are presented on standard dataset.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117349834","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
Dynamic group search algorithm 动态群搜索算法
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743276
R. Tang, S. Fong, S. Deb, R. Wong
{"title":"Dynamic group search algorithm","authors":"R. Tang, S. Fong, S. Deb, R. Wong","doi":"10.1109/ISCBI.2016.7743276","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743276","url":null,"abstract":"Recently many researchers invented a wide variety of meta-heuristic optimization algorithms and they have achieved remarkable performance results. Through observing natural phenomena, clues were inspired and programmed into search logics, such as PSO, Cuckoo Search and so on. Although those algorithms have promising performance, there still exist a drawback - it is hard to find a perfect balance between the global exploration and local exploitation from the traditional swarm optimization algorithms. Like an either-or problem, algorithms that have better global exploration capability come with worse local exploitation capability, and vice versa. In order to address this problem, in this paper, we propose a novel Dynamic Group Search Algorithm (DGSA) with enhanced intra-group and inter-group communication mechanisms. In particular, we devise a formless “group” concept, where the vectors of solutions can move to different groups dynamically based on the group best solution fitness, the better group has the more vectors. Vectors inside a group mainly focus on the local exploitation for enhancing its local search. In contrast, inter group communication assures strong capability of global exploration. In order to avoid being stuck at local optima, we introduce two types of crossover operators and an inter-group mutation. Experiments using benchmarking test functions for comparing with other well-known optimization algorithms are reported. DGSA outperform others in most cases.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128218701","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}
引用次数: 5
CUSE: A novel cube-based approach for sequential pattern mining CUSE:一种新的基于多维数据集的顺序模式挖掘方法
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743281
M. Sohrabi, V. Ghods
{"title":"CUSE: A novel cube-based approach for sequential pattern mining","authors":"M. Sohrabi, V. Ghods","doi":"10.1109/ISCBI.2016.7743281","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743281","url":null,"abstract":"Sequences are one of the most important types of patterns which are extracted from datasets and are used to construct association rules. Several sequential pattern mining methods have been proposed in the literature. This paper introduces a novel bit wise approach to compress and represent the sequence database as a 3-dimentional array and use a corresponding mining method to extract frequent sequences from the compressed structure. Experimental results and performance study show that this algorithm outperforms the best previously developed algorithms.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133714597","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}
引用次数: 18
A new management mode based on mobile Internet 基于移动互联网的新型管理模式
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743251
Liwei Yang, Han Li, B. Liu
{"title":"A new management mode based on mobile Internet","authors":"Liwei Yang, Han Li, B. Liu","doi":"10.1109/ISCBI.2016.7743251","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743251","url":null,"abstract":"After passing through many hierarchical management levels, the information tends to distort, which may lead to decreased efficiency, and poor ability to adapt to external changes. We provide a new kind of flat management modes based on mobile Internet. With the mobile social App, the human relations are flattened, which means the information can breakthrough level barriers and be immediately exchanged; the human communication is realized by rich medium, which means the audio, video, image and text can be exchanged; the human expression is in our media, which means the information reflect the expresser's true opinions; the human communication is beyond the limit of intertemporal dimension, which means the information can be exchanged anytime and anywhere. The flat management mode can penetrate into all aspects of the performance management, and makes management activities more transparent.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132814363","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
Projection profile based ligature segmentation of Nastaleeq Urdu OCR 基于投影轮廓的纳斯塔列克乌尔都语OCR结扎分割
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743278
Aejaz Farooq Ganai, Ajay Koul
{"title":"Projection profile based ligature segmentation of Nastaleeq Urdu OCR","authors":"Aejaz Farooq Ganai, Ajay Koul","doi":"10.1109/ISCBI.2016.7743278","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743278","url":null,"abstract":"Urdu Nastaleeq is a highly cursive, context sensitive language, written diagonally from top right to bottom left. This makes it difficult to segment the partial word or a complete word into characters. Further due to stacking of characters, the segmentation at the character level is hard to perform. Some researchers have performed the segmentation and have succeeded to a good extent, but still some classes of Urdu alphabets have not been recognized yet. Moreover accuracy of segmentation is still less and has to be improved to develop Optical Character Recognition. We present a Novel approach of Projection Profile methodology for segmentation of Urdu Nastaleeq Ligature. The various challenges encountered during segmentation have been discussed in detail.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402034","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
Multiple object tracking based on energy minimization 基于能量最小化的多目标跟踪
2016 4th International Symposium on Computational and Business Intelligence (ISCBI) Pub Date : 2016-09-01 DOI: 10.1109/ISCBI.2016.7743285
Li Wei, Li Xingwei
{"title":"Multiple object tracking based on energy minimization","authors":"Li Wei, Li Xingwei","doi":"10.1109/ISCBI.2016.7743285","DOIUrl":"https://doi.org/10.1109/ISCBI.2016.7743285","url":null,"abstract":"The article focuses on the research of multiple object tracking of the pedestrian in surveillance video sequence. We apply the tracking-by-detection algorithm framework to tracking, and the algorithm kernel is formulating multiple object tracking as an energy minimization problem. The main research emphasis is the construction of energy function which is expected to represent the real-world scenes as faithfully as possible. We focus on solving the difficult problems of the temporal occlusion and object collision. The final optimal solution is the output of the well studied α - expansion framework with graph cuts. We demonstrate the state-of-the-art tracking performance of our method on several public available standard datasets, including PETS2009 and TUD. What's more, we make the quantitative evaluation using CLEAR MOT metrics and compare the performance of our algorithm with other presented advanced methods, showing the excellent performance of our method.","PeriodicalId":424486,"journal":{"name":"2016 4th International Symposium on Computational and Business Intelligence (ISCBI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122322062","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
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书