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

2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)最新文献

筛选
英文 中文
Genetic algorithm in boosting for object class image segmentation 遗传算法增强在目标类图像分割中的应用
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054143
N. Quang, Huynh Thi Thanh Binh, N. T. Thuy
{"title":"Genetic algorithm in boosting for object class image segmentation","authors":"N. Quang, Huynh Thi Thanh Binh, N. T. Thuy","doi":"10.1109/SOCPAR.2013.7054143","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054143","url":null,"abstract":"We describe how a task in computer vision can be effectively resolved by employing Genetic Algorithm. This paper focuses on the problem of semantic segmentation of digital images. We propose to use an improved genetic algorithm for the learning parameters of weak classifiers in a boosting learning set up. We propose a new encoding and genetic operators in accordance with this problem. Beside that, we employed multiple image features such as texture-layout, location, color and HoG for improving the accuracy of the system. Experiments are conducted extensively on MSRC, a widely used benchmark image datasets. The experimental results demonstrate that the performance of our system is comparable to, or even outperforms the state-of-the-art algorithms in semantic segmentation.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131147205","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
A solution for resolving inter-sentential anaphoric pronouns for Vietnamese paragraphs composing two single sentences 越南语两单句段句间回指代词的解决方法
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054120
T. Tran, Dang Tuan Nguyen
{"title":"A solution for resolving inter-sentential anaphoric pronouns for Vietnamese paragraphs composing two single sentences","authors":"T. Tran, Dang Tuan Nguyen","doi":"10.1109/SOCPAR.2013.7054120","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054120","url":null,"abstract":"The aim of this paper is proposing a solution for resolving inter-sentential anaphoric pronouns for Vietnamese paragraphs in which each paragraph composes only two single sentences. We present the solution through two phases: phase one is posing suitable finding antecedent strategies for each pronoun; phase two is presenting the mechanisms which are performed in GULP (Graph Unification Logic Programming) for implementing these strategies. In this research, we classify the paragraphs into four groups based on distinct characteristics so that we can propose the suitable finding antecedent strategy for each group.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130181776","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}
引用次数: 11
An approach to abstractive text summarization 一种抽象文本摘要的方法
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054161
H. T. Le, T. M. Le
{"title":"An approach to abstractive text summarization","authors":"H. T. Le, T. M. Le","doi":"10.1109/SOCPAR.2013.7054161","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054161","url":null,"abstract":"Abstractive summarization is the technique of generating a summary of a text from its main ideas, not by copying verbatim most salient sentences from text. This is an important and challenge task in natural language processing. In this paper, we propose an approach to abstractive text summarization based on discourse rules, syntactic constraints, and word graph. Discourse rules and syntactic constraints are used in the process of generating sentences from keywords. Word graph is used in the sentence combination process to represent word relations in the text and to combine several sentences into one. Experimental results show that our approach is promising in solving the abstractive summarization task.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130844270","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}
引用次数: 32
Solving dynamic optimisation problems by combining evolutionary algorithms with KD-tree 将进化算法与kd树相结合解决动态优化问题
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054136
Trung-Thanh Nguyen, I. Jenkinson, Zaili Yang
{"title":"Solving dynamic optimisation problems by combining evolutionary algorithms with KD-tree","authors":"Trung-Thanh Nguyen, I. Jenkinson, Zaili Yang","doi":"10.1109/SOCPAR.2013.7054136","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054136","url":null,"abstract":"In this paper we propose a novel evolutionary algorithm that is able to adaptively separate the explored and unexplored areas to facilitate detecting changes and tracking the moving optima. The algorithm divides the search space into multiple regions, each covers one basin of attraction in the search space and tracks the corresponding moving optimum. A simple mechanism was used to estimate the basin of attraction for each found optimum, and a special data structure named KD-Tree was used to memorise the searched areas to speed up the search process. Experimental results show that the algorithm is competitive, especially against those that consider change detection an important task in dynamic optimisation. Compared to existing multi-population algorithms, the new algorithm also offers less computational complexity in term of identifying the appropriate sub-population/region for each individual.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"360 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120838267","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
Performance analysis of the Imperialist Competitive algorithm using benchmark functions 使用基准函数的帝国竞争算法的性能分析
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054157
M. A. F. Mollinetti, J. Almeida, Rodrigo Lisbôa Pereira, O. N. Teixeira
{"title":"Performance analysis of the Imperialist Competitive algorithm using benchmark functions","authors":"M. A. F. Mollinetti, J. Almeida, Rodrigo Lisbôa Pereira, O. N. Teixeira","doi":"10.1109/SOCPAR.2013.7054157","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054157","url":null,"abstract":"In this paper, in order to prove the effectiveness of the Imperialist Competitive Algorithm - a socio-political inspired algorithm-on finding the optimal solution for different kinds of minimization functions as well as different kinds of landscapes. The reliability and quality of solutions for mathematical minimization functions of the ICA is evaluated by seven distinct benchmark functions where each one displays different behaviors, and then the results of each test is compared with two other optimization techniques, the Particle Swarm Optimization (PSO) and the Differential Evolution (DE).","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814187","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
AHP-based micro and small enterprises' cluster identification 基于层次分析法的小微企业集群识别
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054132
Netsanet Jote, B. Beshah, D. Kitaw, A. Abraham
{"title":"AHP-based micro and small enterprises' cluster identification","authors":"Netsanet Jote, B. Beshah, D. Kitaw, A. Abraham","doi":"10.1109/SOCPAR.2013.7054132","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054132","url":null,"abstract":"Micro and Small Enterprises' (MSEs) cluster is a group of small firms operating in a defined geographic location, producing similar products or services, cooperating and competing with one another, learning from each other to solve internal problems, setting common strategies to overcome external challenges, and reaching distance markets through developed networks. During recent years, identifying MSEs cluster has become a key strategic decision. However, the nature of these decisions is usually complex and involves conflicting criteria. The aim of this paper is to develop an AHP-based MSEs cluster identification model. As a result, quantitative and qualitative factors including geographical proximity, sectorial concentration, market potential, support services, resource potential and potential entrepreneurs are found to be critical factors in cluster identification. In this paper, linguistic values are used to assess the ratings and weights of the factors. Then, AHP model will be proposed in dealing with the cluster selection problems. Finally, a case study was taken to prove and validate the procedure of the proposed method. A sensitivity analysis is also performed to justify the results.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123047125","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
Ranking with fuzzy decision trees 模糊决策树排序
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054146
Xuan Tuan Le, C. Marsala
{"title":"Ranking with fuzzy decision trees","authors":"Xuan Tuan Le, C. Marsala","doi":"10.1109/SOCPAR.2013.7054146","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054146","url":null,"abstract":"Ranking objects with decision trees has recently received much attention of researchers, with prospect of utilizing significant advantages of the tree model. This paper checks the ranking ability of fuzzy decision trees in bipartite ranking setting. The main reason for the introduction of fuzzy decision trees in classification is the presence of imprecise and imperfect data which is unhandled by classical trees. In this study, we introduce another advantage of fuzzy decision trees: their ability in performing instance-ranking based on class membership degrees associated with each instance. The ranking abilities of other methods using classical decision tree are also examined. Experiments show that the ranking performance of fuzzy decision trees is better than others on clean datasets and outperforms them on noisy datasets.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270377","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
Text-dependent speaker recognition for vietnamese 越南语文本依赖的说话人识别
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054126
Diep Dao Thi Thu, Van Loan Trinh, H. Nguyen, Hung Pham Ngoc
{"title":"Text-dependent speaker recognition for vietnamese","authors":"Diep Dao Thi Thu, Van Loan Trinh, H. Nguyen, Hung Pham Ngoc","doi":"10.1109/SOCPAR.2013.7054126","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054126","url":null,"abstract":"This paper presents a new method for Vietnamese text-dependent speaker recognition. The system is modeled for each speaker using mixture model Gaussian GMM (Gaussian Mixture Model). The phonemes in the keywords are represented by hidden Markov models HMM. The prior and posterior probabilities for keywords and speakers have been combined together to identify speakers. The results showed that in the case the speaker did not say a long enough phrase, this approach has increased performance of speaker identification.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123616056","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}
引用次数: 7
A multi-agent model to simulate the spread of contagious diseases in urban areas 模拟城市地区传染病传播的多智能体模型
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054142
Rajaonarivo Hiary Landy, Hô Tuòng Vinh
{"title":"A multi-agent model to simulate the spread of contagious diseases in urban areas","authors":"Rajaonarivo Hiary Landy, Hô Tuòng Vinh","doi":"10.1109/SOCPAR.2013.7054142","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054142","url":null,"abstract":"The study of epidemic's propagation in cities has become a crucial problem because of the importance of population mobility and promoting rapid contagion between individuals. The authorities of contaminated cities have not, in general, a more or less clear understanding of the evolution of the disease in order to take suitable decisions to fight efficiently against the epidemic. This paper presents an agent-based model devoted to the study of the spread of an epidemic in urban areas. Taking into account the interactions between agents in the urban environment and during their daily activities, the model allows studying the evolution of the epidemic and identifying factors that impact positively or negatively on the spread of the epidemic.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124862899","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
Using motif information to improve anytime time series classification 利用基序信息改进任意时间序列的分类
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054095
Nguyen Quoc Viet Hung, D. T. Anh
{"title":"Using motif information to improve anytime time series classification","authors":"Nguyen Quoc Viet Hung, D. T. Anh","doi":"10.1109/SOCPAR.2013.7054095","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054095","url":null,"abstract":"Anytime algorithm for time series classification requires the ordering heuristic of the instances in the training set. To establish the ordering, the algorithm must compute the distance between every pair of time series in the training set. And this step incurs a high computational cost, especially when Dynamic Time Warping distance is used. In this paper, we present an method to speed up the computation of this step. Our method hinges on the ordering of time series motifs detected by a previous task rather than ordering the original time series. Experimental results show that our new ordering method improves remarkably the efficiency of the anytime algorithm for time series classification without sacrificing its accuracy.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"142 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120870904","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学术官方微信