Because mining complete set of frequent patterns from dense database could be impractical, an interesting alternative has been proposed recently. Instead of mining the complete set of frequent patterns, the new model ...Because mining complete set of frequent patterns from dense database could be impractical, an interesting alternative has been proposed recently. Instead of mining the complete set of frequent patterns, the new model only finds out the maximal frequent patterns, which can generate all frequent patterns. FP-growth algorithm is one of the most efficient frequent-pattern mining methods published so far. However, because FP-tree and conditional FP-trees must be two-way traversable, a great deal memory is needed in process of mining. This paper proposes an efficient algorithm Unid_FP-Max for mining maximal frequent patterns based on unidirectional FP-tree. Because of generation method of unidirectional FP-tree and conditional unidirectional FP-trees, the algorithm reduces the space consumption to the fullest extent. With the development of two techniques: single path pruning and header table pruning which can cut down many conditional unidirectional FP-trees generated recursively in mining process, Unid_FP-Max further lowers the expense of time and space.展开更多
The problem of association rule mining has gained considerable prominence in the data mining community for its use as an important tool of knowledge discovery from large scale databases. And there has been a spurt of...The problem of association rule mining has gained considerable prominence in the data mining community for its use as an important tool of knowledge discovery from large scale databases. And there has been a spurt of research activities around this problem. However, traditional association rule mining may often derive many rules in which people are uninterested. This paper reports a generalization of association rule mining called φ association rule mining. It allows people to have different interests on different itemsets that arethe need of real application. Also, it can help to derive interesting rules and substantially reduce the amount of rules. An algorithm based on FP tree for mining φ frequent itemset is presented. It is shown by experiments that the proposed methodis efficient and scalable over large databases.展开更多
China and Vietnam have maintained close theatrical exchange.A group of Vietnamese students studied at the Central Academy of Drama and the National Academy of Chinese Theatre Arts(NACTA)of China in the 1950s and’60s....China and Vietnam have maintained close theatrical exchange.A group of Vietnamese students studied at the Central Academy of Drama and the National Academy of Chinese Theatre Arts(NACTA)of China in the 1950s and’60s.The past decade has witnessed steadily improving relations between the two countries.Their cultural exchange,especially in theatrical arts,has become increasingly fruitful in three distinct ways.展开更多
In wind and solar renewable-dominant hybrid alternating current/direct current(AC/DC)power systems,the active power of high-voltage direct current(HVDC)system is significantly limited by the security and stability eve...In wind and solar renewable-dominant hybrid alternating current/direct current(AC/DC)power systems,the active power of high-voltage direct current(HVDC)system is significantly limited by the security and stability events caused by cascading failures.To identify critical lines in cascading failures,a rapid risk assessment method is proposed based on the gradient boosting decision tree(GBDT)and frequent pat-tern growth(FP-Growth)algorithms.First,security and stability events triggered by cascading failures are analyzed to explain the impact of cascading failures on the maximum DC power.Then,a cascading failure risk index is defined,focusing on the DC power being limited.To handle the strong nonlinear relationship between the maximum DC power and cascading failures,a GBDT with an update strategy is utilized to rapidly predict the maximum DC power under uncertain operating conditions.Finally,the FP-Growth algorithm is improved to mine frequent patterns in cascading failures.The importance index for each fault in a frequent pattern is defined by evaluating its impact on cascading failures,enabling the identification of critical lines.Simulation results of a modified Ningxia–Shandong hybrid AC/DC system in China demonstrate that the proposed method can rapidly assess the risk of cascading failures and effectively identify critical lines.展开更多
基金Supported by the National Natural Science Foundation of China ( No.60474022)Henan Innovation Project for University Prominent Research Talents (No.2007KYCX018)
文摘Because mining complete set of frequent patterns from dense database could be impractical, an interesting alternative has been proposed recently. Instead of mining the complete set of frequent patterns, the new model only finds out the maximal frequent patterns, which can generate all frequent patterns. FP-growth algorithm is one of the most efficient frequent-pattern mining methods published so far. However, because FP-tree and conditional FP-trees must be two-way traversable, a great deal memory is needed in process of mining. This paper proposes an efficient algorithm Unid_FP-Max for mining maximal frequent patterns based on unidirectional FP-tree. Because of generation method of unidirectional FP-tree and conditional unidirectional FP-trees, the algorithm reduces the space consumption to the fullest extent. With the development of two techniques: single path pruning and header table pruning which can cut down many conditional unidirectional FP-trees generated recursively in mining process, Unid_FP-Max further lowers the expense of time and space.
文摘The problem of association rule mining has gained considerable prominence in the data mining community for its use as an important tool of knowledge discovery from large scale databases. And there has been a spurt of research activities around this problem. However, traditional association rule mining may often derive many rules in which people are uninterested. This paper reports a generalization of association rule mining called φ association rule mining. It allows people to have different interests on different itemsets that arethe need of real application. Also, it can help to derive interesting rules and substantially reduce the amount of rules. An algorithm based on FP tree for mining φ frequent itemset is presented. It is shown by experiments that the proposed methodis efficient and scalable over large databases.
文摘China and Vietnam have maintained close theatrical exchange.A group of Vietnamese students studied at the Central Academy of Drama and the National Academy of Chinese Theatre Arts(NACTA)of China in the 1950s and’60s.The past decade has witnessed steadily improving relations between the two countries.Their cultural exchange,especially in theatrical arts,has become increasingly fruitful in three distinct ways.
基金supported by the National Key Research and Development Program of China"Key technologies for system stability and HVDC transmission of large-scale renewable energy generation base without conventional power support(2022YFB2402700)"the project of the State Grid Corporation of China(52272222001J).
文摘In wind and solar renewable-dominant hybrid alternating current/direct current(AC/DC)power systems,the active power of high-voltage direct current(HVDC)system is significantly limited by the security and stability events caused by cascading failures.To identify critical lines in cascading failures,a rapid risk assessment method is proposed based on the gradient boosting decision tree(GBDT)and frequent pat-tern growth(FP-Growth)algorithms.First,security and stability events triggered by cascading failures are analyzed to explain the impact of cascading failures on the maximum DC power.Then,a cascading failure risk index is defined,focusing on the DC power being limited.To handle the strong nonlinear relationship between the maximum DC power and cascading failures,a GBDT with an update strategy is utilized to rapidly predict the maximum DC power under uncertain operating conditions.Finally,the FP-Growth algorithm is improved to mine frequent patterns in cascading failures.The importance index for each fault in a frequent pattern is defined by evaluating its impact on cascading failures,enabling the identification of critical lines.Simulation results of a modified Ningxia–Shandong hybrid AC/DC system in China demonstrate that the proposed method can rapidly assess the risk of cascading failures and effectively identify critical lines.
