Relational clustering models for knowledge discovery and recommender systems

Cluster analysis is a fundamental research field in Knowledge Discovery and Data Mining (KDD). It aims at partitioning a given dataset into some homogeneous clusters so as to reflect the natural hidden data structure. Various heuristic or statistical approaches have been developed for analyzing propositional datasets. Nevertheless, in relational clustering the existence of multi-type relationships will greatly degrade the performance of traditional clustering algorithms. This issue motivates us to find more effective algorithms to conduct the cluster analysis upon relational datasets. In this thesis we comprehensively study the idea of Representative Objects for approximating data distribution and then design a multi-phase clustering framework for analyzing relational datasets with high effectiveness and efficiency. The second task considered in this thesis is to provide some better data models for people as well as machines to browse and navigate a dataset. The hierarchical taxonomy is widely used for this purpose. Compared with manually created taxonomies, automatically derived ones are more appealing because of their low creation/maintenance cost and high scalability. Up to now, the taxonomy generation techniques are mainly used to organize document corpus. We investigate the possibility of utilizing them upon relational datasets and then propose some algorithmic improvements. Another non-trivial problem is how to assign suitable labels for the taxonomic nodes so as to credibly summarize the content of each node. Unfortunately, this field has not been investigated sufficiently to the best of our knowledge, and so we attempt to fill the gap by proposing some novel approaches. The final goal of our cluster analysis and taxonomy generation techniques is to improve the scalability of recommender systems that are developed to tackle the problem of information overload. Recent research in recommender systems integrates the exploitation of domain knowledge to improve the recommendation quality, which however reduces the scalability of the whole system at the same time. We address this issue by applying the automatically derived taxonomy to preserve the pair-wise similarities between items, and then modeling the user visits by another hierarchical structure. Experimental results show that the computational complexity of the recommendation procedure can be greatly reduced and thus the system scalability be improved

Proceedings, MSVSCC 2015

The Virginia Modeling, Analysis and Simulation Center (VMASC) of Old Dominion University hosted the 2015 Modeling, Simulation, & Visualization Student capstone Conference on April 16th. The Capstone Conference features students in Modeling and Simulation, undergraduates and graduate degree programs, and fields from many colleges and/or universities. Students present their research to an audience of fellow students, faculty, judges, and other distinguished guests. For the students, these presentations afford them the opportunity to impart their innovative research to members of the M&S community from academic, industry, and government backgrounds. Also participating in the conference are faculty and judges who have volunteered their time to impart direct support to their students’ research, facilitate the various conference tracks, serve as judges for each of the tracks, and provide overall assistance to this conference. 2015 marks the ninth year of the VMASC Capstone Conference for Modeling, Simulation and Visualization. This year our conference attracted a number of fine student written papers and presentations, resulting in a total of 51 research works that were presented. This year’s conference had record attendance thanks to the support from the various different departments at Old Dominion University, other local Universities, and the United States Military Academy, at West Point. We greatly appreciated all of the work and energy that has gone into this year’s conference, it truly was a highly collaborative effort that has resulted in a very successful symposium for the M&S community and all of those involved. Below you will find a brief summary of the best papers and best presentations with some simple statistics of the overall conference contribution. Followed by that is a table of contents that breaks down by conference track category with a copy of each included body of work. Thank you again for your time and your contribution as this conference is designed to continuously evolve and adapt to better suit the authors and M&S supporters. Dr.Yuzhong Shen Graduate Program Director, MSVE Capstone Conference Chair John ShullGraduate Student, MSVE Capstone Conference Student Chai

Advances and Novel Approaches in Discrete Optimization

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms

Preventing premature convergence and proving the optimality in evolutionary algorithms

http://ea2013.inria.fr//proceedings.pdfInternational audienceEvolutionary Algorithms (EA) usually carry out an efficient exploration of the search-space, but get often trapped in local minima and do not prove the optimality of the solution. Interval-based techniques, on the other hand, yield a numerical proof of optimality of the solution. However, they may fail to converge within a reasonable time due to their inability to quickly compute a good approximation of the global minimum and their exponential complexity. The contribution of this paper is a hybrid algorithm called Charibde in which a particular EA, Differential Evolution, cooperates with a Branch and Bound algorithm endowed with interval propagation techniques. It prevents premature convergence toward local optima and outperforms both deterministic and stochastic existing approaches. We demonstrate its efficiency on a benchmark of highly multimodal problems, for which we provide previously unknown global minima and certification of optimality

Condition Monitoring System of Wind Turbine Generators

The development and implementation of the condition monitoring systems (CMS) play a significant role in overcoming the number of failures in the wind turbine generators that result from the harsh operation conditions, such as over temperature, particularly when turbines are deployed offshore. In order to increase the reliability of the wind energy industry, monitoring the operation conditions of wind generators is essential to detect the immediate faults rapidly and perform appropriate preventative maintenance. CMS helps to avoid failures, decrease the potential shutdowns while running, reduce the maintenance and operation costs and maintain wind turbines protected. The knowledge of wind turbine generators\u27 faults, such as stator and rotor inter-turn faults, is indispensable to perform the condition monitoring accurately, and assist with maintenance decision making. Many techniques are utilized to avoid the occurrence of failures in wind turbine generators. The majority of the previous techniques that are applied to monitor the wind generator conditions are based on electrical and mechanical concepts and theories. An advanced CMS can be implemented by using a variety of different techniques and methods to confirm the validity of the obtained electrical and mechanical condition monitoring algorithms. This thesis is focused on applying CMS on wind generators due to high temperature by contributing the statistical, thermal, mathematical, and reliability analyses, and mechanical concepts with the electrical methodology, instead of analyzing the electrical signal and frequencies trends only. The newly developed algorithms can be compared with previous condition monitoring methods, which use the electrical approach in order to establish their advantages and limitations. For example, the hazard reliability techniques of wind generators based on CMS are applied to develop a proper maintenance strategy, which aims to extend the system life-time and reduce the potential failures during operation due to high generator temperatures. In addition, the use of some advanced statistical techniques, such as regression models, is proposed to perform a CMS on wind generators. Further, the mechanical and thermal characteristics are employed to diagnose the faults that can occur in wind generators. The rate of change in the generator temperature with respect to the induced electrical torque; for instance is considered as an indicator to the occurrence of faults in the generators. The behavior of the driving torque of the rotating permanent magnet with respect to the permanent magnet temperature can also utilize to indicate the operation condition. The permanent magnet model describes the rotating permanent magnet condition during operation in the normal and abnormal situations. In this context, a set of partial differential equations is devolved for the characterization of the rotations of the permanent. Finally, heat transfer analysis and fluid mechanics methods are employed to develop a suitable CMS on the wind generators by analyzing the operation conditions of the generator\u27s heat exchanger. The proposed methods applied based on real data of different wind turbines, and the obtained results were very convincing