808 research outputs found
A Survey on Compiler Autotuning using Machine Learning
Since the mid-1990s, researchers have been trying to use machine-learning
based approaches to solve a number of different compiler optimization problems.
These techniques primarily enhance the quality of the obtained results and,
more importantly, make it feasible to tackle two main compiler optimization
problems: optimization selection (choosing which optimizations to apply) and
phase-ordering (choosing the order of applying optimizations). The compiler
optimization space continues to grow due to the advancement of applications,
increasing number of compiler optimizations, and new target architectures.
Generic optimization passes in compilers cannot fully leverage newly introduced
optimizations and, therefore, cannot keep up with the pace of increasing
options. This survey summarizes and classifies the recent advances in using
machine learning for the compiler optimization field, particularly on the two
major problems of (1) selecting the best optimizations and (2) the
phase-ordering of optimizations. The survey highlights the approaches taken so
far, the obtained results, the fine-grain classification among different
approaches and finally, the influential papers of the field.Comment: version 5.0 (updated on September 2018)- Preprint Version For our
Accepted Journal @ ACM CSUR 2018 (42 pages) - This survey will be updated
quarterly here (Send me your new published papers to be added in the
subsequent version) History: Received November 2016; Revised August 2017;
Revised February 2018; Accepted March 2018
Video Abstracting at a Semantical Level
One the most common form of a video abstract is the movie trailer. Contemporary movie trailers share a common structure across genres which allows for an automatic generation and also reflects the corresponding moviea s composition. In this thesis a system for the automatic generation of trailers is presented. In addition to action trailers, the system is able to deal with further genres such as Horror and comedy trailers, which were first manually analyzed in order to identify their basic structures. To simplify the modeling of trailers and the abstract generation itself a new video abstracting application was developed. This application is capable of performing all steps of the abstract generation automatically and allows for previews and manual optimizations. Based on this system, new abstracting models for horror and comedy trailers were created and the corresponding trailers have been automatically generated using the new abstracting models. In an evaluation the automatic trailers were compared to the original Trailers and showed a similar structure. However, the automatically generated trailers still do not exhibit the full perfection of the Hollywood originals as they lack intentional storylines across shots
Trajectory Mining for Movement Ecology of Animals
Tohoku University橋本浩一課
Cased Based Reasoning in Business Process Management Design
Dissertation presented as the partial requirement for obtaining a Master's degree in Information Management, specialization in Information Systems and Technologies ManagementArtificial intelligence became increasingly useful since the 1990s, trying to imitate the human brain with its thinking, reasoning, and learning using the key concepts of machine learning, deep learning, and artificial neural networks. Case-based reasoning (CBR), another form of artificial intelligence, stores and retrieves past cases that can be adapted to find a solution to a current problem. The new solution can then be retained and made available to solve other future problems. Business Process Management (BPM) analyzes and optimizes business processes to make them more effective and efficient for an organization’s strategy to ultimately increasing shareholder value. CBR can help to support BPM, making better decisions with existing knowledge when solving process problems. This study investigates effectively store, retrieve, and adapt Business Process Management Notation (BPMN) solutions that best fit the underlying BPM problem using case-based reasoning as a tool. Therefore, a theoretical model was proposed, containing each CBR live cycle phase with different possible tools applied to BPMN diagrams, which was validated by expert interviews. This study concludes that a whole CBR life cycle can be applied to BPMN diagram problems with the need for human intervention. This work did not have the objective to solve the whole problem but to contribute to a possible solution by using CBR through a theoretical model
Mining and Visualizing Research Networks using the Artefact-Actor-Network Approach
Reinhardt, W., Wilke, A., Moi, M., Drachsler, H., & Sloep, P. B. (2012). Mining and Visualizing Research Networks using the Artefact-Actor-Network Approach. In A. Abraham (Ed.), Computational Social Networks. Mining and Visualization (pp. 233-268). Springer. Also available at http://www.springer.com/computer/communication+networks/book/978-1-4471-4053-5Virtual communities are increasingly relying on technologies and tools of the so-called Web 2.0. In the context of scientific events and topical Research Networks, researchers use Social Media as one main communication channel. This raises the question, how to monitor and analyze such Research Networks. In this chapter we argue that Artefact-Actor-Networks (AANs) serve well for modeling, storing and mining the social interactions around digital learning resources originating from various learning services. In order to deepen the model of AANs and its application to Research Networks, a relevant theoretical background as well as clues for a prototypical reference implementation are provided. This is followed by the analysis of six Research Networks and a detailed inspection of the results. Moreover, selected networks are visualized. Research Networks of the same type show similar descriptive measures while different types are not directly comparable to each other. Further, our analysis shows that narrowness of a Research Network's subject area can be predicted using the connectedness of semantic similarity networks. Finally conclusions are drawn and implications for future research are discussed
Rating prediction on yelp academic dataset using paragraph vectors
This work studies the application of Paragraph Vectors to the Yelp Academic Dataset reviews in order to predict user ratings for different categories of businesses like auto repair, restaurants or veterinarians. Paragraph Vectors is a word embeddings techniques were each word or piece of text is converted to a continuous low dimensional space. Then, the opinion mining or sentiment analysis is observed as a classification task, where each user review is associated with a label the rating - and a probabilistic model is built with a logistic classifier. Following the intuition that the semantic information present in textual user reviews is generally more complex and complete than the numeric rating itself, this work applies Paragraph Vectors successfully toYelp dataset and evaluates its results.info:eu-repo/semantics/acceptedVersio
- …