{"title":"Semantic Concept Detection Using Weighted Discretization Multiple Correspondence Analysis for Disaster Information Management","authors":"Samira Pouyanfar, Shu‐Ching Chen","doi":"10.1109/IRI.2016.82","DOIUrl":"https://doi.org/10.1109/IRI.2016.82","url":null,"abstract":"Multimedia semantic concept detection is an emerging research area in recent years. One of the prominent challenges in multimedia concept detection is data imbalance. In this study, a multimedia data mining framework for interesting concept detection in videos is presented. First, the Minimum Description Length (MDL) discretization algorithm is extended to handle the imbalanced data. Thereafter, a novel Weighted Discretization Multiple Correspondence Analysis (WD-MCA) algorithm based on the Multiple Correspondence Analysis (MCA) approach is proposed to maximize the correlation between the feature value pairs and concept classes by incorporating the discretization information captured from the MDL module. The proposed framework achieves promising performance to videos containing disaster events. The experimental results demonstrate the effectiveness of the WD-MCA algorithm, specifically for imbalanced datasets, compared to several existing methods.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132966620","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":"Spekl: A Layered System for Specification Authoring, Sharing, and Usage","authors":"J. Singleton, Gary T. Leavens","doi":"10.1109/IRI.2016.24","DOIUrl":"https://doi.org/10.1109/IRI.2016.24","url":null,"abstract":"Compositional reuse of software libraries is important for productivity. To promote reliability and correctness, the field also needs a way to compose specifications for reuse. How-ever, specifications cannot be adapted by the use of wrappers in the same ways as code can, which leads to specifications being copied and modified. This copying and modification of specifications leads to poor maintainability and technical debt. We propose a system, Spekl, that solves these problems and makes compositional reuse of specifications possible in a way independent of the choice of specification languages and tools.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121259959","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":"Algorithmic Decision Support for Personalized Education (Invited Paper)","authors":"Tyler Morrow, Sahra Sedigh Sarvestani, A. Hurson","doi":"10.1109/IRI.2016.32","DOIUrl":"https://doi.org/10.1109/IRI.2016.32","url":null,"abstract":"This paper describes algorithmic decision support that facilitates recommendation of course schedules personalized to the background and interests of a given student. More specifically, recommendations are made with prioritized consideration of four categories of information: (1) degree requirements, (2) student interests, (3) student performance, and (4) time-to-degree. All four categories of information may not be available for a given student. The algorithm generates personalized recommendations by constructing a graph from degree requirements, identifying critical paths in the graph, and placing such paths within a course schedule. We describe the implementation of the algorithm in the context of PERCEPOLIS, a Pervasive Cyberinfrastructure for Personalized Learning and Instructional Support, a framework constructed in our earlier work on personalized learning.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115199021","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}
Tegjyot Singh Sethi, M. Kantardzic, Elaheh Arabmakki
{"title":"Monitoring Classification Blindspots to Detect Drifts from Unlabeled Data","authors":"Tegjyot Singh Sethi, M. Kantardzic, Elaheh Arabmakki","doi":"10.1109/IRI.2016.26","DOIUrl":"https://doi.org/10.1109/IRI.2016.26","url":null,"abstract":"Machine learning models deployed in real world applications, operate in a dynamic environment where the data distribution can change constantly. These changes, called concept drifts, cause the performance of the learned model to degrade over time. As such it is essential to detect and adapt to changes in the data, for the model to be of any real use. While, model adaptation requires labeled data (for retraining), the detection process does not have to. Labeling data is time consuming and expensive, and if data changes are infrequent, most of the labeling effort, spent on verification, is wasted. In this paper, an ensemble based detection method is proposed, which tracks the number of samples in the critical disagreement regions of the ensemble, to detect concept drift from unlabeled data. The proposed algorithm, is-distribution and model independent, unsupervised and can be used in an online incremental fashion. Experimental analysis on 4 real world concept drift datasets shows that the proposed methodology gives high prediction performance, low false alarm rate and uses only 11.3% overall labeling, on average.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121765735","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":"General Methods for Access Control Policy Verification (Application Paper)","authors":"Vincent C. Hu, D. R. Kuhn","doi":"10.1109/IRI.2016.49","DOIUrl":"https://doi.org/10.1109/IRI.2016.49","url":null,"abstract":"Access control systems are among the most critical of computer security components. Faulty policies, misconfigurations, or flaws in software implementations can result in serious vulnerabilities. To formally and precisely capture the security properties that access control should adhere to, access control models are usually written, bridging the gap in abstraction between policies and mechanisms. Identifying discrepancies between policy specifications and their intended function is crucial because correct implementation and enforcement of policies by applications is based on the premise that the policy specifications are correct. As a result, policy specifications represented by models must undergo rigorous verification and validation through systematic verification and testing to ensure that the policy specifications truly encapsulate the desires of the policy authors. Verifying the conformance of access control policies and models is a non-trivial and critical task, and one important aspect of such verification is to formally check the inconsistency and incompleteness of the model and safety requirements of the policy, because an access control model and its implementation do not necessarily explicitly express the policy, which can also be implicitly embedded by mixing with direct access constraints or other access control models.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128151297","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}
Awny Alnusair, Majdi Rawashdeh, Mohammed F. Alhamid, M. A. Hossain, Muhammad Ghulam
{"title":"Reusing Software Libraries Using Semantic Graphs","authors":"Awny Alnusair, Majdi Rawashdeh, Mohammed F. Alhamid, M. A. Hossain, Muhammad Ghulam","doi":"10.1109/IRI.2016.79","DOIUrl":"https://doi.org/10.1109/IRI.2016.79","url":null,"abstract":"This paper describes a two-part system that helps developers understand how to search and reuse complex software libraries. First, we present an approach for automatic retrieval of software components in reuse libraries. Second, the system implements a source-code recommendation approach which automatically constructs and delivers relevant code examples that demonstrate how the retrieved components can be used to solve particular programming problems. In arriving at such solutions, we utilize ontological modeling to provide semantic representation of the conceptual source-code knowledge in software libraries. This representation is the basis for computing entailments and enabling semantic reasoning. Our experiments show evidence that combining ontology formalisms with context-sensitive techniques enhance precision when retrieving and recommending reusable code even without mining a carefully crafted corpus of similar code.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124940858","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}
B. Thuraisingham, Murat Kantarcioglu, Kevin W. Hamlen, L. Khan, Timothy W. Finin, A. Joshi, T. Oates, E. Bertino
{"title":"A Data Driven Approach for the Science of Cyber Security: Challenges and Directions","authors":"B. Thuraisingham, Murat Kantarcioglu, Kevin W. Hamlen, L. Khan, Timothy W. Finin, A. Joshi, T. Oates, E. Bertino","doi":"10.1109/IRI.2016.10","DOIUrl":"https://doi.org/10.1109/IRI.2016.10","url":null,"abstract":"This paper describes a data driven approach to studying the science of cyber security (SoS). It argues that science is driven by data. It then describes issues and approaches towards the following three aspects: (i) Data Driven Science for Attack Detection and Mitigation, (ii) Foundations for Data Trustworthiness and Policy-based Sharing, and (iii) A Risk-based Approach to Security Metrics. We believe that the three aspects addressed in this paper will form the basis for studying the Science of Cyber Security.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115286899","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}
T. Bouabana-Tebibel, S. Rubin, Asmaa Chebba, Sofiane Bediar, Syphax Iskounen
{"title":"Knowledge Induction Based on Randomization in Case-Based Reasoning","authors":"T. Bouabana-Tebibel, S. Rubin, Asmaa Chebba, Sofiane Bediar, Syphax Iskounen","doi":"10.1109/IRI.2016.80","DOIUrl":"https://doi.org/10.1109/IRI.2016.80","url":null,"abstract":"Case-Based Reasoning (CBR) interests the scientific community, whom are concerned with scalability in knowledge representation and processing. CBR systems scale far better than rule-based systems. Rule-based systems are limited by the need to know the rules of engagement, which is practically unobtainable. The work presented in this paper pertains to knowledge generalization based on randomization. Inductive knowledge is inferred through subsumption and transmutation rules. Knowledge is dynamically generated, thus allowing for a gain in the inferential space and research time. It is validated based on the domain user expertise. The approach is illustrated with an example and is seen to be properly implemented and tested.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124460420","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":"Predicting Cancer Relapse with Clinical Data: A Survey of Current Techniques","authors":"Aaron N. Richter, T. Khoshgoftaar","doi":"10.1109/IRI.2016.56","DOIUrl":"https://doi.org/10.1109/IRI.2016.56","url":null,"abstract":"While cancer treatments are constantly advancing, there is still a real risk of relapse after potentially curative treatments. At the risk of adverse side effects, certain adjuvant treatments can be given to patients that are at high risk of recurrence. The challenge, however, is in finding the best tradeoff between these two extremes. Patients that are given more potent treatments, such as chemotherapy, radiation, or systemic treatment, can suffer unnecessary consequences, especially if the cancer does not return. Predictive modeling of recurrence can help inform patients and practitioners on a case-by-case basis, personalized for each patient. For large-scale predictive models to be built, structured data must be captured for a wide range of diverse patients. This paper explores current methods for building cancer recurrence risk models using structured clinical patient data.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129691194","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 Risk-Benefit Driven Architecture for Personal Data Release (Invited Paper)","authors":"B. C. Singh, B. Carminati, E. Ferrari","doi":"10.1109/IRI.2016.14","DOIUrl":"https://doi.org/10.1109/IRI.2016.14","url":null,"abstract":"Personal data storages (PDSs) give individuals the ability to store their personal data in a data unified repository and control release of their data to data consumers. Being able to gather personal data from different data sources (e.g., banks, hospitals), PDSs will play strategic role in individual privacy management. As such, PDS demands for new privacy models for protecting personal data. In this paper, we propose a new technical approach that empowers individuals to better control data in PDS. Particularly, we present a privacy-aware PDS architecture by focusing on two logical data zones based on the categories of personal data. Moreover, we propose a strategy for regulating personal data release that takes in consideration both user preferences and possible risks and benefits of the data release.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130736224","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}