Dissertations / Theses on the topic 'Approximate Mining'

Pattern matching approaches in reverse engineering aim to incorporate domain knowledge and system documentation in the software architecture extraction process, hence provide a user/tool collaborative environment for architectural design recovery. This thesis presents a model and an environment for recovering the high level design of legacy software systems based on user defined architectural patterns and graph matching techniques. In the proposed model, a high-level view of a software system in terms of the system components and their interactions is represented as a query, using a description language. A query is mapped onto a pattern-graph, where a module and its interactions with other modules are represented as a group of graph-nodes and a group of graph-edges, respectively. Interaction constraints can be modeled by the description language as a part of the query. Such a pattern-graph is applied against an entity-relation graph that represents the information extracted from the source code of the software system. An approximate graph matching process performs a series of graph edit operations (i. e. , node/edge insertion/deletion) on the pattern-graph and uses a ranking mechanism based on data mining association to obtain a sub-optimal solution. The obtained solution corresponds to an extracted architecture that complies with the given query. An interactive prototype toolkit implemented as part of this thesis provides an environment for architecture recovery in two levels. First the system is decomposed into a number of subsystems of files. Second each subsystem can be decomposed into a number of modules of functions, datatypes, and variables.

碩士<br>東吳大學<br>資訊科學系<br>96<br>To discover association rules, frequent itemset mining can find out items that appear frequently together in a dataset and to be the first step in the analysis of data arising in broad range of application. Moreover, industry can use mining result to improve marketing strategy and profitability. Traditional frequent itemset mining utilizes the “exact” mode. However, the exact-mode mining is not appropriate for real data. Mining noisy data using the exact mode cannot generate correct frequent itemsets, and may eventually lead to incorrect decisions. In recent years, many researchers have studied how to discover frequent itemsets from noisy data. However, existing methods can become inefficient when the dataset is sparse. Therefore, these methods cannot be applied to all kinds of datasets. In this paper, we propose a new algorithm, called the TAFI algorithm, for mining approximate frequent itemsets. The TAFI algorithm not only can correctly and efficiently discover approximate frequent itemsets from noisy data, but also can perform well with spare datasets.

The past two decades have witnessed an explosion in the number of medical and healthcare datasets available to researchers and healthcare professionals. Data collection efforts are highly required, and this prompts the development of appropriate data mining techniques and tools that can automatically extract relevant information from data. Consequently, they provide insights into various clinical behaviors or processes captured by the data. Since these tools should support decision-making activities of medical experts, all the extracted information must be represented in a human-friendly way, that is, in a concise and easy-to-understand form. To this purpose, here we propose a new framework that collects different new mining techniques and tools proposed. These techniques mainly focus on two aspects: the temporal one and the predictive one. All of these techniques were then applied to clinical data and, in particular, ICU data from MIMIC III database. It showed the flexibility of the framework, which is able to retrieve different outcomes from the overall dataset. The first two techniques rely on the concept of Approximate Temporal Functional Dependencies (ATFDs). ATFDs have been proposed, with their suitable treatment of temporal information, as a methodological tool for mining clinical data. An example of the knowledge derivable through dependencies may be "within 15 days, patients with the same diagnosis and the same therapy usually receive the same daily amount of drug". However, current ATFD models are not analyzing the temporal evolution of the data, such as "For most patients with the same diagnosis, the same drug is prescribed after the same symptom". To this extent, we propose a new kind of ATFD called Approximate Pure Temporally Evolving Functional Dependencies (APEFDs). Another limitation of such kind of dependencies is that they cannot deal with quantitative data when some tolerance can be allowed for numerical values. In particular, this limitation arises in clinical data warehouses, where analysis and mining have to consider one or more measures related to quantitative data (such as lab test results and vital signs), concerning multiple dimensional (alphanumeric) attributes (such as patient, hospital, physician, diagnosis) and some time dimensions (such as the day since hospitalization and the calendar date). According to this scenario, we introduce a new kind of ATFD, named Multi-Approximate Temporal Functional Dependency (MATFD), which considers dependencies between dimensions and quantitative measures from temporal clinical data. These new dependencies may provide new knowledge as "within 15 days, patients with the same diagnosis and the same therapy receive a daily amount of drug within a fixed range". The other techniques are based on pattern mining, which has also been proposed as a methodological tool for mining clinical data. However, many methods proposed so far focus on mining of temporal rules which describe relationships between data sequences or instantaneous events, without considering the presence of more complex temporal patterns into the dataset. These patterns, such as trends of a particular vital sign, are often very relevant for clinicians. Moreover, it is really interesting to discover if some sort of event, such as a drug administration, is capable of changing these trends and how. To this extent, we propose a new kind of temporal patterns, called Trend-Event Patterns (TEPs), that focuses on events and their influence on trends that can be retrieved from some measures, such as vital signs. With TEPs we can express concepts such as "The administration of paracetamol on a patient with an increasing temperature leads to a decreasing trend in temperature after such administration occurs". We also decided to analyze another interesting pattern mining technique that includes prediction. This technique discovers a compact set of patterns that aim to describe the condition (or class) of interest. Our framework relies on a classification model that considers and combines various predictive pattern candidates and selects only those that are important to improve the overall class prediction performance. We show that our classification approach achieves a significant reduction in the number of extracted patterns, compared to the state-of-the-art methods based on minimum predictive pattern mining approach, while preserving the overall classification accuracy of the model. For each technique described above, we developed a tool to retrieve its kind of rule. All the results are obtained by pre-processing and mining clinical data and, as mentioned before, in particular ICU data from MIMIC III database.

University of Technology Sydney. Faculty of Engineering and Information Technology.<br>The advance of technology makes data acquisition and storage become unprecedentedly convenient. It contributes to the rapid growth of not only the volume but also the veracity and variety of data in recent years, which poses new challenges to the data mining area. For example, uncertain data mining emerges due to its capability to model the inherent veracity of data; spatial data mining attracts much research attention as the widespread of location-based services and wearable devices. As a fundamental topic of data mining, how to effectively and efficiently summarize data in this situation still remains to be explored. This thesis studied the problem of summarizing data with representative patterns. The objective is to find a set of patterns, which is much more concise but still contains rich information of the original data, and may provide valuable insights for further analysis of data. In the light of this idea, we formally formulate the problem and provide effective and efficient solutions in various scenarios. We study the problem of summarizing probabilistic frequent patterns over uncertain data. Probabilistic frequent pattern mining over uncertain data has received much research attention due to the wide applicabilities of uncertain data. It suffers from the problem of generating an exponential number of result patterns, which hinders the analysis of patterns and calls for the need to find a small number of representative patterns to approximate all other patterns. We formally formulate the problem of probabilistic representative frequent pattern (P-RFP) mining, which aims to find the minimal set of patterns with sufficiently high probability to represent all other patterns. The bottleneck turns out to be checking whether a pattern can probabilistically represent another, which involves the computation of a joint probability of the supports of two patterns. We propose a novel dynamic programming-based approach to address the problem and devise effective optimization strategies to improve the computation efficiency. To enhance the practicability of P-RFP mining, we introduce a novel approximation of the joint probability with both theoretical and empirical proofs. Based on the approximation, we propose an Approximate P-RFP Mining (APM) algorithm, which effectively and efficiently compresses the probabilistic frequent pattern set. The error rate of APM is guaranteed to be very small when the database contains hundreds of transactions, which further affirms that APM is a practical solution for summarizing probabilistic frequent patterns. We address the problem of directly summarizing uncertain transaction database by formulating the problem as Minimal Probabilistic Tile Cover Mining, which aims to find a high-quality probabilistic tile set covering an uncertain database with minimal cost. We define the concept of Probabilistic Price and Probabilistic Price Order to evaluate and compare the quality of tiles, and propose a framework to discover the minimal probabilistic tile cover. The bottleneck is to check whether a tile is better than another according to the Probabilistic Price Order, which involves the computation of a joint probability. We prove that it can be decomposed into independent terms and calculated efficiently. Several optimization techniques are devised to further improve the performance. We analyze the problem of summarizing co-locations mined from spatial databases. Co-location pattern mining finds patterns of spatial features whose instances tend to locate together in geographic space. However, the traditional framework of co-location pattern mining produces an exponential number of patterns because of the downward closure property, which makes it difficult for users to understand, assess or apply the huge number of resulted patterns. To address this issue, we study the problem of mining representative co-location patterns (RCP). We first define a covering relationship between two co-location patterns then formally formulate the problem of Representative Co-location Pattern mining. To solve the problem of RCP mining, we propose the RCPFast algorithm adopting the post-mining framework and the RCPMS algorithm pushing pattern summarization into the co-location mining process.

碩士<br>國立臺灣師範大學<br>資訊教育學系<br>94<br>Repeating patterns represent temporal relations among data items, which could be used for data summarization and data prediction. More and more data of various applications is generated as a data stream. Accordingly, the traditional strategies for mining repeating patterns on static database are not suitable in a data stream environment. Besides, in the dynamic environment of a data stream, mining the repeating patterns from the whole history data sequence does not extract the newest trend of patterns in the data stream. For this reason, two algorithms for efficiently mining recently repeating patterns in a data stream are proposed in this thesis. One is named the appearing-bit-sequence-based incremental mining algorithm and the other one is named the basic-patterns estimating-based algorithm. The incremental mining approach applies appearing bit sequences to compute the frequencies of data patterns efficiently within the sliding window. By maintaining the appearing bit sequences of maximal repeating patterns, the newly generated recently repeating patterns are mined from the maintained information to reduce processing cost when the window slides. The estimating-based method maintains the repeating patterns, potential repeating patterns, and 2-item patterns, a partition-based scheme is used to count the frequencies of patterns. By constructing a data structure to support efficiently access of remained patterns, the frequency of an unretained pattern is estimated according to the frequencies of its maximum prefix-subpattern and suffix-subpattern. The experimental results show that the incremental mining method is an efficient way for mining recently repeating patterns correctly. And the estimating-based method provides a even more faster way to discover recently repeating patterns from a data stream approximately.

碩士<br>國立臺灣師範大學<br>資訊教育學系<br>93<br>Recently, the data of many real applications are generated in the form of data streams. In this thesis, two approximately mining methods, named ATS (Average TimeStamp mining method) and FCP (Frequency Changing Point mining method), are proposed for finding recent frequent itemsets on data streams. In these two approaches, each transaction in the data stream is examined at most once and the appearing summarization of possible recent frequent itemsets is recorded. According to the data structure of appearing summarization, the outdated data which does not belong to the current window can be deleted without needing to store the transactions in the current window. Then recent frequent itemsets can be mined approximately and efficiently. Among the two approaches, FCP algorithm stores the accumulative counts for itemsets at their frequency changing points. Such information can be used to estimate the supports of itemsets in current window and then the recent frequent itemsets are mined approximately. The experimental results show that, FCP algorithm can achieve high precision and recall when used for mining recent frequent itemsets in data streams. Moreover, by comparing with the existing SW algorithm, it shows FCP algorithm improves the efficiency of data maintenance and mining process significantly and reduces the memory usage further.

黃學明.<br>據稿本複印<br>論文(哲學碩士)--香港中文大學中國文學系,1992.<br>參考文獻: leaves 394-414<br>Huang Xueming.<br>前言 --- p.1<br>前言註釋 --- p.5<br>Chapter 一 --- «史記» 單用« 國語» 之部分 --- p.7<br>第一部分註釋 --- p.156<br>Chapter 二 --- « 史記» 兼用« 國語» 、« 左傳» 之部分 --- p.175<br>第二部分註釋 --- p.355<br>結論 --- p.386<br>引用書目 --- p.394

本論文主要探討十六至十七世紀的仙境繪畫及其所反映的仙境觀念，並以歸入仇英名下的仙境圖為中心，通過分析畫中的內容意涵，藉以展現十六至十七世紀明人對仙境圖處理的多樣性。<br>基於現時傳為出自仇英手筆的仙境圖最多，仇英可以說是當時十六至十七世紀對仙境題材創作情況的一個縮影。加上，仇英作為十六世紀具代表性的職業畫家，其仙境圖很有可能是針對具體的「使用對象」而生產，迎合不同人的不同想法和需要。在這種前提下，本文將仇英以及託名仇英的仙境圖理解為十六至十七世紀藝術市場需求下的產物，並從剖析它們的題材和構圖入手，以揭示受畫人對於仙境畫作的情感寄託。<br>所謂仙境圖，即是描繪神仙所居的圖像。仙境圖可歸入山水畫科，而且與山水畫的界定比較模糊。就畫中不同的圖像表現，可將仇英名下的仙境圖分成五類：第一種是以個別神仙入畫的仙境圖；第二種是畫中出現道士煉丹場景的仙境圖；第三種是畫有等候飛昇的歷史人物的仙境圖；第四種是描繪「桃花源」主題的仙境圖；最後一種是懷有文人情調的仙境圖。<br>本文以其中三類仙境圖為例，指出時人對仙境的運用各有差別：以個別神仙入畫的仙境圖較適用於壽慶場合，畫有道士煉丹場景的仙境圖則似是作為當時追求長生的慰藉，而以文人形象入畫的仙境圖即蘊含隱世思想；從而說明這些仙境圖在明代社會中發揮不同的作用，傳達不同的信息，滿足不同的需求，反映出繪畫與使用場合及使用對象之間的緊密關係。<br>This thesis attempts to study the immortal landscape paintings from the sixteenth to seventeenth century as well as the ideas on the realm of immortals embodied in these paintings. Focusing on the immortal landscape paintings attributed to Qiu Ying, this thesis analyses their themes and allusive meanings, and thus presents the diversity in the diverse approaches adopted in the immortal landscape paintings in the late Ming period.<br>Since a majority of the immortal landscape paintings survived today is attributed to Qiu Ying, his works can be seen as the encapsulation of the artistic creations on the theme of the realm of immortals dated in the sixteenth and seventeenth century. A representative professional painter of the time, Qiu Ying probably produced his works for a certain group of intended audience in accordance with a variety of ideas and needs. With this presupposition this thesis regards Qiu Ying’s works and the imitations of such as the products responding the demands of the art market in the sixteenth and seventeenth century. Through an analysis of the subject matter and composition of the paintings, this thesis reveals the sentimental values held by the immortal landscape paintings for their possessors.<br>Depicting the dwellings of deities, immortal landscape paintings can be identified as a sub-genre of landscape paintings and are hardly distinct from other landscape paintings. The immortal landscape paintings by Qiu Ying can be classified into five types in terms of visual elements, including: I) particular deities; II) Taoist adepts practicing alchemy; III) historical figures awaiting respectfully for ascending to celestial realms; IV) Peach Blossom Spring, the Chinese equivalent of utopia; and V) scenes imbued with literati spirit.<br>Of these five types of immortal landscape paintings, examples from three are selected to demonstrate their different functionalities in Ming society; immortal landscape paintings portraying particular deities were created for festive occasions, while those depicting Taoist alchemy and literati figures offered reassurance on the quest for immortality and implied reclusive spirit respectively. Through a detailed investigation this thesis illustrates that immortal landscape paintings were produced to serve a variety of functions, to convey different messages, and to accommodate various needs in Ming society, thus testifying the close association between paintings, objects of utility and the occasions they are created for.<br>Detailed summary in vernacular field only.<br>Detailed summary in vernacular field only.<br>Detailed summary in vernacular field only.<br>Detailed summary in vernacular field only.<br>楊晉宜.<br>"2012年8月".<br>"2012 nian 8 yue".<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2012.<br>Includes bibliographical references (leaves 105-122).<br>Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Abstract in Chinese and English.<br>Yang Jinyi.<br>內容摘要 --- p.i<br>誌謝辭 --- p.v<br>前言 --- p.1<br>Chapter 一、 --- 研究動機與目的 --- p.1<br>Chapter 二、 --- 近人研究概況 --- p.3<br>Chapter 三、 --- 研究意義 --- p.5<br>Chapter 1. --- 仇英仙境圖作為道教藝術的一個面向 --- p.5<br>Chapter 2. --- 仙境圖作為十六世紀藝術市場需求下的產物 --- p.7<br>Chapter 第一章 --- 研究對象的釐清與選取 --- p.9<br>Chapter 一、 --- 仇英與仙境圖的關係 --- p.9<br>Chapter 二、 --- 仙境圖的定義 --- p.16<br>Chapter 三、 --- 仇英仙境圖比例分析 --- p.24<br>Chapter 1. --- 數字統計 --- p.24<br>Chapter 2. --- 歸納分類 --- p.31<br>小結、仙境圖類型與研究路徑 --- p.38<br>Chapter 第二章 --- 仙境圖中的神仙與蟠桃 --- p.40<br>Chapter 一、 --- 兩件畫作的產生情況 --- p.41<br>Chapter 二、 --- 內容意涵的差異 --- p.44<br>Chapter 三、 --- 為祝某人之壽辰 --- p.54<br>小結、神仙形象與仙境圖 --- p.59<br>Chapter 第三章 --- 仙境圖中的道士燒丹場景 --- p.60<br>Chapter 一、 --- 明代有關煉丹的畫作 --- p.61<br>Chapter 二、 --- 燒丹與神仙的關係 --- p.64<br>Chapter 三、 --- 煉丹對明人的意義 --- p.68<br>Chapter 四、 --- 仙真與山水相融的構圖 --- p.71<br>小結、道士燒丹與仙境圖 --- p.74<br>Chapter 第四章 --- 仙境圖中的文人雅趣 --- p.76<br>Chapter 一、 --- 仙境圖中文人形象的顯隱差異 --- p.77<br>Chapter 二、 --- 文人形象在仙境圖的其中一種作用 --- p.84<br>Chapter 1. --- 以玉洞桃花造境 --- p.86<br>Chapter 2. --- 人迹於仙山 --- p.90<br>Chapter 3. --- 畫中人的真實身份 --- p.94<br>小結、文人形象與仙境圖 --- p.99<br>結論 --- p.101<br>參考書目 --- p.105<br>Chapter 附表一、 --- 文獻著錄的仙境圖統計 --- p.124<br>Chapter 附表二、 --- 仇英仙境圖列表 --- p.126<br>Chapter 附表三、 --- 〈蟠桃圖〉各版本場景列表 --- p.128<br>圖版 --- p.131

Chan, Yuen Lai.<br>Thesis submitted in: December 2007.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.<br>Includes bibliographical references (leaves 125-133).<br>Abstracts in English and Chinese ; some text in appendix also in Chinese.<br>Abstract<br>Acknowledgement<br>Table of Contents<br>Chapter 1 --- INTRODUCTION --- p.1<br>Chapter 1.1 --- PAINTER'S EXPERIENCE IN LANDSCAPE --- p.1<br>Chapter 1.1.1 --- Bodily experience and body metaphor of place from western philosophy --- p.2<br>Chapter 1.1.2 --- "Jing, Guo Xi 226}0ةs three distances, and body as mountain and water" --- p.5<br>Chapter 1.2 --- QUESTIONS AND HYPOTHESIS --- p.9<br>Chapter 1.3 --- RESEARCH MATERIALS --- p.10<br>Chapter 1.3.1 --- "Forms, words and images" --- p.10<br>Chapter 1.3.2 --- Research materials --- p.11<br>Chapter 1.4 --- RESEARCH METHODOLOGY --- p.11<br>Chapter 1.4.1 --- Study of gardens from paintings --- p.11<br>Chapter 1.4.2 --- Research methodology --- p.14<br>Chapter 1.5 --- OUTLINE OF THESIS --- p.14<br>Chapter 2 --- LANDSCAPED GARDEN FROM LANDSCAPE PAINTING --- p.17<br>Chapter 2.1 --- WAYS OF LANDSCAPE DEPICTION --- p.17<br>Chapter 2.1.1 --- Early landscape depictions --- p.17<br>Chapter 2.1.2 --- Cultivated garden in natural landscape from Six Dynasties --- p.18<br>Chapter 2.1.3 --- Monumental landscape in Northern Song --- p.19<br>Chapter 2.2 --- EARLY QING NANJING --- p.20<br>Chapter 2.2.1 --- "Geographical settings: Mountain, water and city" --- p.20<br>Chapter 2.2.2 --- Garden culture --- p.21<br>Chapter 2.2.3 --- Artistic milieu --- p.23<br>Chapter 2.3 --- CHAPTER SUMMARY --- p.26<br>Chapter 3 --- GONG XIAN: HALF-ACRE GARDEN ON THE MOUNTAIN OF PURE COOLNESS --- p.32<br>Chapter 3.1 --- GONG XIAN THE LITERATI PAINTER --- p.32<br>Chapter 3.1.1 --- Major Iiteratures on Gong Xian --- p.32<br>Chapter 3.1.2 --- Gong Xian as an 'individualist' painter --- p.34<br>Chapter 3.2 --- HALF-ACRE GARDEN ON MOUNTAIN OF PURE COOLNESS --- p.38<br>Chapter 3.2.1 --- Mountain of Pure Coolness as a historical site --- p.39<br>Chapter 3.2.2 --- Half-acre garden set within Mountain of Pare Coolness --- p.41<br>Chapter 3.2.3 --- A glimpse through half-acre garden --- p.43<br>Chapter 3.3 --- PERMEABLE GARDEN SPACE --- p.47<br>Chapter 3.3.1 --- Ambiguous boundary --- p.48<br>Chapter 3.3.2 --- Everyday social encounters --- p.49<br>Chapter 3.3.3 --- Narrated landscape of the past --- p.52<br>Chapter 3.3.4 --- Imaginary landscape of the mind --- p.53<br>Chapter 3.4 --- CHAPTER SUMMARY --- p.54<br>Chapter 4 --- YUAN JIANG: ZHAN YUAN [OUTLOOK GARDEN] --- p.60<br>Chapter 4.1 --- YUAN JIANG THE PROFESSIONAL PAINTER --- p.60<br>Chapter 4.1.1 --- Major literatures on Yuan Jiang --- p.61<br>Chapter 4.1.2 --- Yuan Jiang as a jiehua painter --- p.62<br>Chapter 4.2 --- ZHAN YUAN --- p.67<br>Chapter 4.2.1 --- The evolutionary fame and popularity of the garden and its designations --- p.68<br>Chapter 4.2.2 --- West Garden of Prince Zhongshan in early Ming --- p.68<br>Chapter 4.2.3 --- West Nursery of Weigong in Ming Wanli reign --- p.69<br>Chapter 4.2.4 --- Zhan Yuan during Qing --- p.70<br>Chapter 4.3 --- TRANSFIGURED GARDEN --- p.77<br>Chapter 4.3.1 --- "Survey on the garden 226}0ةs sceneries, and courtly and paradisiac symbols" --- p.77<br>Chapter 4.3.2 --- Garden portraiture as courtly and paradisiac landscape --- p.80<br>Chapter 4.4 --- CHAPTER SUMMARY --- p.82<br>Chapter 5 --- SUMMARY AND POSSIBILITIES: PAINTER'S PERCEPTION OF GARDEN SPACES --- p.90<br>Chapter 5.1 --- JING OF AN EXPERIENCED GARDEN --- p.90<br>Chapter 5.2 --- TWO GARDEN READINGS FROM TWO ART TRADITIONS --- p.90<br>Chapter 5.2.1 --- Garden boundary and conception --- p.90<br>Chapter 5.2.2 --- Archetypal garden readings --- p.91<br>Chapter 5.2.3 --- Themes of the memorable and the historical past --- p.92<br>Chapter 5.3 --- INSIGHTS AND POSSIBILITIES --- p.92<br>Append --- p.ix<br>Bibliography