2009 2nd Conference on Data Mining and Optimization最新文献

筛选
英文 中文
Capturing uncertainty in associative classification model 关联分类模型中的不确定性捕获
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341904
Y. Choo, A. Bakar, A. Muda
{"title":"Capturing uncertainty in associative classification model","authors":"Y. Choo, A. Bakar, A. Muda","doi":"10.1109/DMO.2009.5341904","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341904","url":null,"abstract":"This paper aims to propose a weighted linguistic associative classification model for uncertainty data analysis using rough membership function. Transformation of quantitative association rules into linguistic representation can be achieved in discretizing the numerical interval into rough interval described with respective rough membership values. Transformation of linguistic information system is suggested prior to the frequent pattern discovery. Neither pruning of association rules nor classifier modelling is needed. The rough membership values of the each linguistic frequent item are composited to form the weighted associative classification rule. Simulated results on Iris Plant dataset were shown in the paper. The future work of the research will focus on implementing the model with more experimental dataset.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129227966","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
Filter-wrapper approach to feature selection using RST-DPSO for mining protein function 基于RST-DPSO的特征选择滤波包装方法挖掘蛋白质功能
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341906
S. A. Rahman, A. Bakar, Z. Mohamed-Hussein
{"title":"Filter-wrapper approach to feature selection using RST-DPSO for mining protein function","authors":"S. A. Rahman, A. Bakar, Z. Mohamed-Hussein","doi":"10.1109/DMO.2009.5341906","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341906","url":null,"abstract":"This paper proposed a feature selection strategy based on rough set theory (RST) and discrete particle swarm optimization (DPSO) methods prior to classify protein function. RST is adopted in the first phase with the aim to eliminate the insignificant features and prepared the reduce features to the next phase. In the second phase, the reduced features are optimized using the new evolutionary computation method, DPSO. The optimum features from this two methods were mined using Support Vector Machine Classifier with the optimum RBF's kernel parameters. These methods have greatly reduced the features and achieved higher classification accuracy across the selected datasets compared to full features and RST alone. The results also demonstrate that the integration of RST and DPSO is capable of searching the optimal features for protein classification and applicable to different classification problem.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114604806","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
An exploration study of nurse rostering practice at Hospital Universiti Kebangsaan Malaysia 马来西亚Kebangsaan医院大学护士名册实践的探索性研究
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341903
Mohammed Hadwan, M. Ayob
{"title":"An exploration study of nurse rostering practice at Hospital Universiti Kebangsaan Malaysia","authors":"Mohammed Hadwan, M. Ayob","doi":"10.1109/DMO.2009.5341903","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341903","url":null,"abstract":"The Nurse Rostering Problem (NRP) is a task of assigning duties fairly among available nurses at healthcare organizations for specific periods of time defined as shifts. NRP belongs to NP-hard problems for which an optimal solution is difficult to be obtained. This paper reports on the practical nurse rostering problem and issues at Hospital Universiti Kebangsaan Malaysia (HUKM). A survey (questionnaire and interviews) was conducted and used as the main tool for gathering primary data concerning the nurses' preferences and other constraints. Furthermore, policy maker views were collected and analyzed. The results identified the majority of rostering problems that the nurses are currently facing at HUKM. The results further revealed that the underlying need for developing an automated fair nurse roster is increasingly becoming critical. Based upon the results, a mathematical model for HUKM nurse rostering problem was formulated. A new objective function was also presented to cope with such a real world problem. Additionally, a new dataset for HUKM was gathered which is readily available for future researches and studies.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128741656","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
A classification of “Gracilaria changii” protein sequences using back-propagation classifier 利用反向传播分类器对“江蓠”蛋白序列进行分类
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341902
N. S. Mohamed, Z. Othman, A. Bakar
{"title":"A classification of “Gracilaria changii” protein sequences using back-propagation classifier","authors":"N. S. Mohamed, Z. Othman, A. Bakar","doi":"10.1109/DMO.2009.5341902","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341902","url":null,"abstract":"This paper focuses on protein sequences family classification from Gracilaria changii seaweed species using back-propagation classifier. Classification of protein sequence family is to infer the function of an unknown protein by analysing its structural similarity to a given family of proteins. The use of sequence alignment technique to classify the protein sequence is less efficient because the entire sequence is used for classification. Data mining offers the uses of an artificial intelligence technique that is well known and good for classification. Therefore, the purpose of this research is to develop protein sequences classification for Gracilaria changii using data mining approach with feature extraction. The feature extraction is to identify the best features in the overall sequence. Data preparation for feature extraction is used bioinformatics tools to translate DNA to protein (Batch Translator) and to analyze the family protein (InterProScan). The feature extraction process is done on the data that has been prepared using the 2-gram method. Features that are obtained with this method are then used to develop the classification model using Back-Propagation Neural Network technique (RNPB). Experiment results from RNPB are then compared with the sequence alignment technique (HMMER). The comparison results show that classification model produced from RNPB is better than sequence alignment technique with average accuracy for the whole family as much as 99.01% compared 96.51%. For the specificity and sensitivity of the prediction, the HMMER and ANN were equally efficient.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121065693","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
Incorporating tabu search into memetic approach for enrolment-based course timetabling problems 将禁忌搜索纳入模因法求解基于招生的课程排课问题
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341901
H. Turabieh, S. Abdullah
{"title":"Incorporating tabu search into memetic approach for enrolment-based course timetabling problems","authors":"H. Turabieh, S. Abdullah","doi":"10.1109/DMO.2009.5341901","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341901","url":null,"abstract":"This work presents a tabu search and a memetic approach to an enrolment based course timetabling problem called Tabu-based memetic algorithm, the proposed approach employed crossover and mutation operators to a selected solution from the population. Then applying neighborhood structure randomly which is not in tabu-list to enhance the quality of the solution. The tabu list is used to penalize neighborhood structures that are unable to generate better solutions. We demonstrate that our approach is able to produce good quality solutions due to the ability to select more promising neighborhood structures.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132612977","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}
引用次数: 33
A note on the P-time algorithms for solving the maximum independent set problem 关于求解最大独立集问题的p -时间算法的注释
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341909
Navid Nasr Esfahani, P. Mazrooei, K. Mahdaviani, B. Omoomi
{"title":"A note on the P-time algorithms for solving the maximum independent set problem","authors":"Navid Nasr Esfahani, P. Mazrooei, K. Mahdaviani, B. Omoomi","doi":"10.1109/DMO.2009.5341909","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341909","url":null,"abstract":"In this article, the problem of finding maximum (weight) independent set (M(W)IS) is investigated. It is known that this problem belongs to the class of NP-hard problems. Although, there are polynomial time (P-time) algorithms to solve the M(W)IS problem for some special classes of graphs. Here, we propose a general scheme which extends all of classes that the M(W)IS problem is solvable for them in P-time. This general scheme, based on any P-time algorithm for a class of graphs C, generates a new P-time algorithm to solve the M(W)IS problem for graphs in an extension of the class C. Moreover, this new algorithm is robust.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125295040","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
Dissimilarity algorithm on conceptual graphs to mine text outliers 基于概念图的文本异常值挖掘的不相似算法
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341910
S. S. Kamaruddin, A. Hamdan, A. Bakar, F. M. Nor
{"title":"Dissimilarity algorithm on conceptual graphs to mine text outliers","authors":"S. S. Kamaruddin, A. Hamdan, A. Bakar, F. M. Nor","doi":"10.1109/DMO.2009.5341910","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341910","url":null,"abstract":"The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents. As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining. In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs. In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF). In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation. We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators. For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work. Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. In Comparison to other text outlier detection method, this approach managed to capture the semantics of documents through the use of CGs and is convenient to detect outliers through a simple dissimilarity function. Furthermore, our proposed algorithm retains a linear complexity with the increasing number of CGs.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114726411","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
Hybridization Multi-NeighbourhoodParticle Collision Algorithm and Great Deluge for solving course timetabling problems 求解课程排课问题的杂交多邻域粒子碰撞算法和大洪水算法
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341900
A. Abuhamdah, M. Ayob
{"title":"Hybridization Multi-NeighbourhoodParticle Collision Algorithm and Great Deluge for solving course timetabling problems","authors":"A. Abuhamdah, M. Ayob","doi":"10.1109/DMO.2009.5341900","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341900","url":null,"abstract":"This work presents a Particle Collision Algorithm (PCA) to solve university course timetabling problems. The aim is to produce an effective algorithm for assigning a set of courses, lecturers and students to a specific number of rooms and timeslots, subject to a set of constraints. The structure of PCA resembles a simulated annealing structure. The basic difference is that PCA does not have cooling schedule and it does not rely on user-defined parameters. PCA differs from Simulated Annealing and other meta-heuristic approaches where, before accepting the trial solution (although we obtain good-quality solution). Therefore, PCA is capable of escaping from local optima. The Hybrid Multi-Neighbourhood Particle Collision Algorithm with Great Deluge using Composite Neighbourhood Structure (HPCA), which it is hybridize the Great Deluge acceptance criterion with PCA and enhances a PCA approach that was originally introduced by Sacco for policy optimization. HPCA differs from basic PCA in terms of applying multi-neighbourhood composite structures, which is divided into two stages, one in the solution construction phase and the other in the improvement phase. HPCA also differs from basic PCA in terms of accepting the worst solution in the scattering phase, which is hybrid the Great Deluge acceptance criterion with PCA. HPCA attempts to further enhance the trial solution by exploring different neighbourhood structures. Results tested on Socha benchmark datasets show that HPCA is able to produce significantly good quality solutions within a reasonable time and outperformed some other approaches in some instances.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132683991","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}
引用次数: 15
Metaheuristic approaches for optimizing agricultural land areas 优化农业用地面积的元启发式方法
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341914
Ismadi Badarudin, A. B. Sultan, M. N. Sulaiman, A. Mamat, M. Mohamed
{"title":"Metaheuristic approaches for optimizing agricultural land areas","authors":"Ismadi Badarudin, A. B. Sultan, M. N. Sulaiman, A. Mamat, M. Mohamed","doi":"10.1109/DMO.2009.5341914","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341914","url":null,"abstract":"Metaheuristic approaches are the most selected technique to find optimization solution intelligently in many areas of timetabling and scheduling, space allocation, decision making and others. These approaches have promised a better solution in single objective optimization problem. However, there is no revealed discussion on the issue that has more than one problem. In agricultural land use planning, we found that there are two related problems need to be solved intelligently before obtaining the main objective of optimal solution for the land. The problems are i) to allocate the resources into agricultural land optimally, then ii) to arrange the plant in the planting area in order to find an optimal layout. The solution of the both problems will utilize the land and consequently maximize number of plant to be planted in an area respectively. This paper is preliminary investigation towards optimizing agricultural land, in order that we focus on the understanding of the issues in agricultural land and solution methods by referring to the similarity of the previous researches. We also promote the solutions idea and show the complexity of the problems, and finally find that the metaheuristic approaches are a necessity.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129443990","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
Classification for talent management using Decision Tree Induction techniques 运用决策树归纳技术对人才管理进行分类
2009 2nd Conference on Data Mining and Optimization Pub Date : 2009-12-01 DOI: 10.1109/DMO.2009.5341916
H. Jantan, A. Hamdan, Z. Othman
{"title":"Classification for talent management using Decision Tree Induction techniques","authors":"H. Jantan, A. Hamdan, Z. Othman","doi":"10.1109/DMO.2009.5341916","DOIUrl":"https://doi.org/10.1109/DMO.2009.5341916","url":null,"abstract":"Classification is one of the tasks in Data mining. Nowadays, there are many classification techniques being used to solve classification problems such as Neural Network, Genetic Algorithm, Bayesian and others. In this article, we attempt to present a study on how talent management can be implemented using Decision Tree Induction techniques. By using this approach, talent performance can be predicted using past experience knowledge discovered from the existing database. In the experimental phase, we use selected classification algorithms from Decision tree techniques to propose suitable classifier for the dataset. As a result, the C4.5 classifier algorithm shows the highest accuracy of model for the dataset. Consequently, the possible talent rules are generated based on C4.5 classifier especially for the talent forecasting purposes.","PeriodicalId":426889,"journal":{"name":"2009 2nd Conference on Data Mining and Optimization","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132315896","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}
引用次数: 20
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学术官方微信
小红书