Rodrigo Moura Juvenil Ayres, Rafael Garcia Leonel Miani, M. T. P. Santos
{"title":"A new equation for calculating the weight of fuzzy itemsets","authors":"Rodrigo Moura Juvenil Ayres, Rafael Garcia Leonel Miani, M. T. P. Santos","doi":"10.1109/IRI.2011.6009512","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009512","url":null,"abstract":"This paper proposes a new equation for calculating the weight of fuzzy itemsets candidates. This equation was applied in the NARFO* algorithm [1], which is an approach for mining generalized association rules based on fuzzy ontologies. Another contribution of this work is to perform comparative tests between NARFO* and GARPA algorithm [2]. Experiments showed that NARFO* produces an amount of rules with 60% of reduction in comparison with the amount generated by GARPA algorithm.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"123 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115125353","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}
{"title":"Web service discovery using semi-supervised Block Value Decomposition","authors":"A. Salunke, Minh Nguyen, Xumin Liu, M. Rege","doi":"10.1109/IRI.2011.6009517","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009517","url":null,"abstract":"Service communities help improve the service discovery process by targeting user queries at highly relevant sub-spaces. In this paper, we propose a semi-supervised web service community learning approach using Block Value Decomposition Co-clustering (SS-BVD). Our approach incorporates domain knowledge in the form of must-link and cannot-link constraints and leverages the duality between web services and their operations to significantly improve the homogeneity of communities. By employing BVD, our approach not only supports different numbers of communities for services and operations, but also forms communities for both the services and their operations simultaneously. Through experiments performed on real world web service data, we demonstrate the performance of SS-BVD for service community learning.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"19 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116694164","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}
{"title":"A Cognitive-based scheme for user reliability and expertise assessment in Q&A social networks","authors":"K. Pelechrinis, V. Zadorozhny, V. Oleshchuk","doi":"10.1109/IRI.2011.6009614","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009614","url":null,"abstract":"Q&A social media has gained a great deal of attention during recent years. People rely on these sites to obtain information due to the number of advantages they offer as compared to conventional sources of knowledge (e.g., asynchronous and convenient access). However, for the same question one may find highly contradictory answers, causing ambiguity with respect to the correct information. This can be attributed to the presence of unreliable and/or non-expert users. In this work, we propose a novel approach for estimating the reliability and expertise of a user based on human cognitive traits. Every user can individually estimate these values based on local pairwise interactions. We examine the convergence performance of our algorithm and we find that it can accurately assess the reliability and the expertise of a user and can successfully react to the latter's behavior change.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116954942","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}
Adriane P. Chapman, B. Blaustein, Lenny M. Seligman, David Allen
{"title":"PLUS: A provenance manager for integrated information","authors":"Adriane P. Chapman, B. Blaustein, Lenny M. Seligman, David Allen","doi":"10.1109/IRI.2011.6009558","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009558","url":null,"abstract":"It can be difficult to fully understand the result of integrating information from diverse sources. When all the information comes from a single organization, there is a collective knowledge about where it came from and whether it can be trusted. Unfortunately, once information from multiple organizations is integrated, there is no longer a shared knowledge of the data and its quality. It is often impossible to view and judge the information from a different organization; when errors occur, notification does not always reach all users of the data. We describe how a multi-organizational provenance store that collects provenance from heterogeneous systems addresses these problems. Unlike most provenance systems, we cope with an open world, where the data usage is not determined in advance and can take place across many systems and organizations.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"27 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120812913","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}
Sylvia Radeschütz, M. Vrhovnik, H. Schwarz, B. Mitschang
{"title":"Exploiting the symbiotic aspects of process and operational data for optimizing business processes","authors":"Sylvia Radeschütz, M. Vrhovnik, H. Schwarz, B. Mitschang","doi":"10.1109/IRI.2011.6009532","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009532","url":null,"abstract":"A profound analysis of all relevant business data in a company is necessary for optimizing business processes effectively. Current analyses typically run either on business process execution data or on operational business data. Correlations among the separate data sets have to be found manually under big effort. However, to achieve a more informative analysis and to fully optimize a company's business, an efficient consolidation of all major data sources is indispensable. Recent matching algorithms are insufficient for this task since they are restricted either to schema or to process matching. We present a new matching framework to combine process data models and operational data models (semi-)automatically for performing such a profound business analysis. We describe this approach and its basic matching rules as well as an experimental study that shows the achieved high recall and precision.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121005169","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}
{"title":"Study of definable subsets in covering approximation spaces of rough sets","authors":"Nianbai Fan, Gongzhu Hu, Hui Liu","doi":"10.1109/IRI.2011.6009514","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009514","url":null,"abstract":"Intelligent decision systems often need to deal with vague and uncertain data. Several approaches are commonly used to address this problem, such as statistical methods, machine learning, and fuzzy set. Overlapping with but different from the fuzzy set theory, rough set theory is a relatively new mathematical approach to vague data analysis. A rough set is basically an approximation representation of the given data. The representation is expressed in two subsets defined on the data set: the upper and lower approximations. The main difference between the rough set theory and other approaches is that it does not rely on preliminary information about the data such as membership probabilities of the data items required for fuzzy set. One of the open questions in rough set is to decide if a subset of a covering approximation space is definable. In this paper, we answer this question by investigating the approximation operator and conclude the relation of the inner definable, outer definable, and definable subsets of a covering approximation space under certain conditions.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127182964","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}
{"title":"A respecification and extension of DeLone and McLean model of IS success in the citizen-centric e-governance","authors":"S. Jafari, N. Ali, M. Sambasivan, M. Said","doi":"10.1109/IRI.2011.6009571","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009571","url":null,"abstract":"Citizen-centric e-governance is an emerging approach in the case of designing and implementing the e-governance systems with the specific focus on the effectiveness. Based on this perspective, the citizens' needs and values on e-governance have to be put first to make these systems effective. This study is an attempt to explore and propose the needs and values of citizens on the e-governance systems based on the determinants of information system (IS) success in the DeLone and McLean 2003 (D&M 2003) model of IS success. After conducting a comprehensive literature review, this study proposed new determinants of e-governance success and the citizen-centric e-governance success model. This model can be considered as the respecified and extended model of D&M 2003 model of IS success in the specific context of the citizen-centric e-governance systems.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125928965","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}
{"title":"Mining transcriptional association rules from breast cancer profile data","authors":"Rakhi Malpani, M. Lu, Du Zhang, W. Sung","doi":"10.1109/IRI.2011.6009538","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009538","url":null,"abstract":"To gain insight into regulatory mechanisms underlying the transcription process of gene expressions, we need to understand the co-expressed gene sets under common regulatory mechanisms. Though computational methods have been developing to identify expression module, challenges still remain for cancer related gene expression profiling. In this paper, we have developed a method of data preprocessing and two different association rule mining approaches for discovering breast cancer regulatory mechanisms of gene module. Our data preprocessing task involved with two independent data sources: (a) a single breast cancer patient profile data file, (b) a candidate enhancer information data file. Using the integrated data, we also conducted four experiments of the association rule mining.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126095917","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}
{"title":"Adaptive fuzzy formation control for a nonholonomic robotic swarm","authors":"F. Shabaninia, Seyed Hamid Reza Abbasi","doi":"10.1109/IRI.2011.6009596","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009596","url":null,"abstract":"In this paper, artificial potential functions are used to design the formation control input for kinematic model of the robots and matrix manipulations are used to transform nonholonomic model of a differentially driven vehicle into equivalent holonomic one. The advantages of the proposed controller can be listed as robustness to input nonlinearity, external disturbances, model uncertainties and measurement noises. Simulation results are demonstrated for a swarm formation problem of a group of six unicycles, illustrating the effective attenuation of approximation error.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123561673","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}
{"title":"Social network analysis of research collaboration in information reuse and integration","authors":"Min-Yuh Day, Sheng-Pao Shih, Weide Chang","doi":"10.1109/IRI.2011.6009615","DOIUrl":"https://doi.org/10.1109/IRI.2011.6009615","url":null,"abstract":"The study of information reuse and integration (IRI) is a young research field and the increasing degrees of collaboration in this field can be attributed to a predominant trend of networked publication co-authorship which itself contributes a feedback effect to the growth of the IRI community as a whole. Our analysis is based on the positive trends in the IRI community over the process of research and knowledge diffusion. Prolific researchers often initiate new ideas and achieve impacts on the whole research community. The objective of our analysis is to provide accurate viewpoints into the social-networking nature among research collaborations, including identifications of prolific researchers and research groups, trends of their collaborations, and impacts to the research community. By applying analytical processes that discover various collaboration and networking degrees exhibited in the publication co-authorship statistics obtained from our IRI community, we are able to synthesize results which identify research groups, collaboration patterns, and trends.","PeriodicalId":124677,"journal":{"name":"2011 IEEE International Conference on Information Reuse & Integration","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114589179","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}