<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Subject: search.filters.subject.association rule

Search Results

Now showing 1 - 7 of 7
  • Thumbnail Image
    Item type:Item,
    An association mining method for time series and its application in the stock prices of TFT-LCD industry
    (2004)
    Huang, CF
    ;
    Chen, YC
    ;
    Chen, AP
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    TFT-LCD is one of industries currently promoted by the "Two Trillion and Twin Star Industries Development Plan" in Taiwan. This study endeavors to find out the stock price associations between the suppliers and manufacturers in the value chain of the TFT-LCD industry by means of data mining techniques, and meanwhile, to improve the Apriori algorithm so that it can facilitate association mining of discrete data points in a time series. An efficient data mining method which consists of two phases is proposed. In the first phase, data are classified and preprocessed using the algorithm proposed by R. Agrawal et al. (1996), then Apriori algorithm is applied to extract the strong association rules. The second phase further improves the Apriori algorithm by breaking down the traditional limitation of relying on pattern matching of continuous data for disclosing stock market behavior. By mining the association rules from the discrete data points in a time series and testing the corresponding hypotheses, statistically significant outcomes can be obtained. The proposed data mining method was applied to some real time-series of the stock prices of companies in the supply chain of TFT-LCD industry in Taiwan. It is suggested that a positive correlation does not necessarily exist between the companies' stock prices in the supply chain of TFT-LCD industry. For instance the result shows that, if the stock price of Sintek Phonrotic Corp., a company in the up stream of the value chain, soars for more than 5% in a day, the stock price of Tatung, a company in the down stream of the same value chain, may not respond positively accordingly. If an investor can short the stock of Tatung on the 7th day and long it back on the 10th day after Sintek's stock price soaring for more than 5%, the annual return of investment is 199.88% with 95% confidence interval. In conclusion, the results may reveal helpful information for the investors to make leveraged arbitrage profit investing decisions, and it might be interesting to apply this proposed data mining method to the time series in other industries or problems and investigate the results further.
  • Thumbnail Image
    Item type:Item,
    A three-phased online association rule mining approach for diverse mining requests
    (2004)
    Wang, CY
    ;
    Tseng, SS
    ;
    Hong, TP
    ;
    Chu, YS
    ;
    資訊工程學系
    In the past, most incremental mining and online mining algorithms considered finding the set of association rules or patterns consistent with the entire set of data inserted so far. Users can not easily obtain the results from their only interested portion of data. For providing ad-hoc, query-driven and online mining supports, we first propose a relation called multidimensional pattern relation to structurally and systematically store the context information and the mining information for later analysis. Each tuple in the relation comes from an inserted dataset in the database. This concept is similar to the construction of a data warehouse for OLAP. However, unlike the summarized information of fact attributes in a data warehouse, the mined patterns in the multidimensional pattern relation can not be directly aggregated to satisfy, users' mining requests. We then develop an online mining approach called Three-phased Online Association Rule Mining (TOARM) based on the proposed multidimensional pattern relation to support online generation of association rules under multidimensional considerations. Experiments for both homogeneous and heterogeneous datasets are made, with results showing the effectiveness of the proposed approach.
  • Thumbnail Image
    Item type:Item,
    Multidimensional on-line mining
    (2006)
    Wang, CY
    ;
    Hong, TP
    ;
    Tseng, SS
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In the past;, incremental mining approaches usually considered getting the newest; set; of knowledge consistent; with the entire set of data inserted so far. Users can not, however, use them to obtain rules or patterns only from their interesting portion of the data. In addition, these approaches only focused on finding frequent patterns in a specified part of a database. That is, although the data records are collected in under certain time, place and category, such contexts (circumstances) have been ignored in conventional mining algorithms. It will cause the lack of patterns or rules to help users solve problems at, different, aspects and with diverse considerations. In this paper, we thus attempt; to extend incremental mining to online decision support under multidimensional context considerations. We first propose the multidimensional pattern relation to structurally and systematically retain the additional context information and mining information for each inserted dataset into a database. We then develop an algorithm based on the proposed multidimensional pattern relation to correctly and efficiently fulfill diverse on-fine mining requests.
  • Thumbnail Image
    Item type:Item,
    Using data mining technology to build an intelligent manufacturing system for semiconductor industry
    (2006)
    Chen, Ruey-Shun
    ;
    Chang, Chan-Chine
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    In this paper, we propose a flexible three-tier architecture for data mining in semiconductor manufacturing. The architecture allows a high-performance implementation of data mining techniques using association rule. The prototype is able to mine patterns from large data sets that reside in databases. There are benefits to use the data mining control system that is implemented by association rule in computer integrated manufacturing (CIM) environment. The result shows that the proposed intelligent manufacturing system can improve product yield rate and reduce cycle time in semiconductor manufacturing. It could find the best machines of process machine sets that affect processes. It also enhances wafer yield accuracy, reduces production costs and promotes the enterprise competitiveness.
  • Thumbnail Image
    Item type:Item,
    Flexible online association rule mining based on multidimensional pattern relations
    (2006-06-22)
    Wang, CY
    ;
    Tseng, SS
    ;
    Hong, TP
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Most incremental mining and online mining algorithms concentrate on finding association rules or patterns consistent with entire current sets of data. Users cannot easily obtain results from only interesting portion of data. This may prevent the usage of mining from online decision support for multidimensional data. To provide ad-hoc, query-driven, and online mining support, we first propose a relation called the multidimensional pattern relation to structurally and systematically store context and mining information for later analysis. Each tuple in the relation comes from an inserted dataset in the database. We then develop an online mining approach called three-phase online association rule mining (TOARM) based on this proposed multidimensional pattern relation to support online generation of association rules under multidimensional considerations. The TOARM approach consists of three phases during which final sets of patterns satisfying various mining requests are found. It first selects and integrates related mining information in the multidimensional pattern relation, and then if necessary, re-processes itemsets without sufficient information against the underlying datasets. Some implementation considerations for the algorithm are also stated in detail. Experiments on homogeneous and heterogeneous datasets were made and the results show the effectiveness of the proposed approach. (c) 2005 Elsevier Inc. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    Mining association rules through integration of clustering analysis and ant colony system for health insurance database in Taiwan
    (2007-10-01)
    Kuo, R. J.
    ;
    Lin, S. Y.
    ;
    Shih, C. W.
    ;
    工業工程與管理學系
    ;
    Department of Industrial Engineering and Management
    In addition to sharing and applying the knowledge in the community, knowledge discovery has become an important issue in the knowledge economic era. Data mining plays an important role of knowledge discovery. Therefore, this study intends to propose a novel framework of data mining which clusters the data first and then followed by association rules mining. The first stage employs the ant system-based clustering algorithm (ASCA) and ant K-means (AK) to cluster the database, while the ant colony system-based association rules mining algorithm is applied to discover the useful rules for each group. The medical database provided by the National Health Insurance Bureau of Taiwan Government is used to verify the proposed method. The evaluation results showed that the proposed method not only is able to extract the rules much faster, but also can discover more important rules. (c) 2006 Published by Elsevier Ltd.
  • Thumbnail Image
    Item type:Item,
    Online generation of association rules under multi-dimensional consideration based on negative-border
    (2007-01-01)
    Wang, Ching-Yao
    ;
    Tseng, Shian-Shyong
    ;
    Hong, Tzung-Pei
    ;
    Chu, Yian-Shu
    ;
    資訊工程學系
    Recently, some researchers have developed incremental and online mining approaches to maintain association rules without having to re-process the entire database whenever the database is updated or user specified thresholds are changed. However, they usually can not flexibly obtain association rules or patterns from portions of data, consider problems with different aspects, or provide online decision support for users. We earlier developed an online mining approach for generation of association rules under multidimensional consideration. The multidimensional online mining approach may, however, get loose upper-bound support of candidate itemsets and thus cause excessive I/O and computation costs. In this paper, we attempt to apply the concept of a negative border to enlarge the mining information in the multidimensional pattern relation to help get tighter upper-bound, and thus reduce the number of candidate itemsets to consider. Based oh the extended multidimensional pattern relation, a corresponding online mining approach called Negative-Border Online Mining (NOM) is proposed to efficiently and effectively utilize the information of negative itemset in the negative border. Experiments for heterogeneous datasets are also performed to show the effectiveness of the proposed approach.