2009 24th International Symposium on Computer and Information Sciences最新文献

Towards an interdisciplinary methodology for service-oriented system engineering 面向服务的系统工程的跨学科方法论

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291875

V. Bicer, S. Lamparter, York Sure-Vetter, A. Dogru

引用次数: 5

Single stripe projection based range scanning of shiny objects under ambient light 环境光下基于单条投影的发光物体距离扫描

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291931

R. Benveniste, C. Ünsalan

引用次数: 7

Stableness in large join query optimization 大连接查询优化中的稳定性

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291898

Tarcizio Alexandre Bini, Adriano Lange, M. Sunyé, Fabiano Silva

引用次数: 7

Does attention capacity correlate with the effects of chord function on phoneme monitoring? 注意能力与和弦功能对音素监测的影响是否相关?

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291812

N. Atalay, M. Misirlisoy

引用次数: 2

Joint visual attention modeling for naturally interacting robotic agents 自然交互机器人主体的联合视觉注意建模

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291820

Zeynep Yücel, A. A. Salah, Çetin Meriçli, Tekin Meriçli

引用次数: 23

Prediction of protein-protein interactions in yeast using SVMs with genomics/proteomics information and feature selection 基于基因组学/蛋白质组学信息和特征选择的支持向量机预测酵母蛋白质相互作用

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291899

J. M. Ortiz, I. Rojas, H. Pomares, L. Herrera, G. Rubio, J. P. Florido

{"title":"Prediction of protein-protein interactions in yeast using SVMs with genomics/proteomics information and feature selection","authors":"J. M. Ortiz, I. Rojas, H. Pomares, L. Herrera, G. Rubio, J. P. Florido","doi":"10.1109/ISCIS.2009.5291899","DOIUrl":"https://doi.org/10.1109/ISCIS.2009.5291899","url":null,"abstract":"In current Proteomics research, prediction of protein-protein interactions (PPIs) is one of the main goals, since PPIs explain most of the cellular biological processes. In the present work, we propose a method for prediction of protein-protein interactions in Yeast. Our proposal is based on the well-known classification paradigm called Support Vector Machines and a well-known feature selection method (Relief) using Ge-nomics/Proteomics information. In order to obtain higher values of specificity and sensitivity in predicting PPIs, we use a high reliable set of positive and negative examples from which to extract a set of proteomic/genomic features. We also introduce a similarity measure for pairs of proteins to calculate additional features from well-known databases, that allow us to improve the prediction capability of our approach. After applying a feature selection method, we construct SVM classifiers that obtain a low error rate in the prediction for each pair of proteins. Finally, we analyse and compare the prediction quality of the method proposed with other high-confidence datasets from other works.","PeriodicalId":184263,"journal":{"name":"2009 24th International Symposium on Computer and Information Sciences","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115093467","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

Making functional similarity count for more reliable effort prediction models 为更可靠的努力预测模型计算功能相似度

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291870

Özden Özcan Top, Onur Demirörs, O. Türetken

引用次数: 3

Domain specific phase by phase effort estimation in software projects 软件项目中特定领域的阶段性工作估算

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291873

Yigit Kultur, Ekrem Kocaguneli, A. Bener

引用次数: 10

Channel assignment problem in cellular networks: A reactive tabu search approach 蜂窝网络中的信道分配问题:一种反应性禁忌搜索方法

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291830

Didem Gözüpek, Gaye Genç, Cem Ersoy

引用次数: 13

Frequent itemsets hiding: A performance evaluation framework 隐藏频繁项集:性能评估框架

2009 24th International Symposium on Computer and Information Sciences Pub Date : 2009-10-23 DOI: 10.1109/ISCIS.2009.5291903

Osman Abul, Harun Gökçe, Yagmur Sengez

{"title":"Frequent itemsets hiding: A performance evaluation framework","authors":"Osman Abul, Harun Gökçe, Yagmur Sengez","doi":"10.1109/ISCIS.2009.5291903","DOIUrl":"https://doi.org/10.1109/ISCIS.2009.5291903","url":null,"abstract":"Sensitive knowledge hiding is an essential requirement to prevent disclosure of any sensitive knowledge holding in shared databases. The security of a database may be risked when it is made public as is: because the data mining tools are so sophisticated that the sensitive knowledge can easily be surfaced by receivers. This gives rise to a sanitization process which transforms the original database into another database, the released one, which does not hold the sensitive knowledge but can substitute the original otherwise. In case the sensitive knowledge is of the form frequent itemsets, the resulting concrete problem is called frequent itemsets hiding. A number of algorithms, exploiting different approaches and techniques, for frequent itemsets hiding problem is proposed in the literature. Since finding optimal solutions is NP-Hard, algorithms resort to certain heuristics having different levels of sophistication, complexity, efficiency and effectiveness. This paper presents an evaluation framework which implements recent algorithms belonging to different approaches and a set of metrics to gauge the performance and problem difficulties. The current work also presents an experimental study and its results where four algorithms and seven datasets are involved. Our results indicate that data distortion levels and runtime requirements are quite high, especially for difficult problem instances. Our conclusion is that there are new rooms for more sophisticated and tuneable (w.r.t. effectiveness/efficiency tradeoff) algorithms.","PeriodicalId":184263,"journal":{"name":"2009 24th International Symposium on Computer and Information Sciences","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124226860","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