Results 51 to 60 of about 801,363 (206)

A Design‐Driven Machine Learning Approach for Invariant Mining in a Smart Grid

open access: yesIET Cyber-Physical Systems: Theory &Applications, Volume 11, Issue 1, January/December 2026.
An ICS is vulnerable to cyber‐attacks arising from within its communication network or directly from the SCADA and devices such as PLCs. The study reported here presents a scenario‐specific invariant mining approach to detect anomalies in plant behaviour.
Danish Hudani   +5 more
wiley   +1 more source

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets [PDF]

open access: yes, 2022
Closed high utility itemsets (CHUIs) and maximal high utility itemsets (MaxHUIs) are two important concise representations of HUIs. Discovering these itemsets is important because they are lossless and compact, i.e., they provide a concise summary of all
Dương, Văn Hải   +2 more
core   +1 more source

Extraction of Safe Operation Rules and Identification of Vulnerable Nodes in Power Grids Based on Time‐Series Association Analysis

open access: yesIET Generation, Transmission &Distribution, Volume 20, Issue 1, January/December 2026.
This paper presents a data‐driven framework for operational safety rule extraction and vulnerable node identification in power grids with high renewable penetration. The effectiveness of the proposed method is verified on the IEEE 39‐bus system for static security assessment. ABSTRACT High renewable energy penetration introduces significant uncertainty
Zhilin Huang   +6 more
wiley   +1 more source

Mining frequent closed itemsets from a landmark window over online data streams [PDF]

open access: yes, 2009
The frequent closed itemsets determine exactly the complete set of frequent itemsets and are usually much smaller than the later. However, mining frequent closed itemsets from a landmark window over data streams is a challenging problem.
Liu, Xuejun, Hu, Ping, Guan, Jihong
core   +1 more source

From Prediction to Prevention: Using Text Mining and Explainable Machine Learning for Urban Bus Accident Analytics

open access: yesRisk Analysis, Volume 46, Issue 1, January 2026.
ABSTRACT Urban bus accidents present major safety and operational challenges, particularly in densely populated metropolitan areas. This study develops a machine learning‐based analytical framework to identify, quantify, and interpret the factors associated with severe bus accidents.
Bowei Chen   +3 more
wiley   +1 more source

Correlation Analysis of Influencing Factors of Autonomous Vehicle Accidents Based on Improved Apriori Algorithm

open access: yesJournal of Advanced Transportation, Volume 2026, Issue 1, 2026.
The purpose of this study was to explore the risk factors for autonomous vehicle (AV) crashes and their interdependencies. A total of 659 AV crash data were collected between 2018 and July 2024 from AV crash reports published by the California Department of Motor Vehicles.
Tao Wang   +4 more
wiley   +1 more source

Mining closed high utility itemsets based on propositional satisfiability

open access: yes, 2021
International audienceA high utility itemset mining problem is the question of recognizing a set of items that have utility values greater than a given user utility threshold.
Hidouri, Amel   +3 more
core   +1 more source

Mining frequent patterns for AMP-activated protein kinase regulation on skeletal muscle

open access: yesBMC Bioinformatics, 2006
Background AMP-activated protein kinase (AMPK) has emerged as a significant signaling intermediary that regulates metabolisms in response to energy demand and supply.
Chen Yi-Ping, Chen Qingfeng
doaj   +1 more source

RPriori: A Divide‐and‐Conquer Frequent Itemset Mining Algorithm With Improved Time‐Space Efficiency on Large Transactional Data

open access: yesComplexity, Volume 2026, Issue 1, 2026.
Frequent itemset mining (FIM) is a fundamental task in data mining with applications ranging from market basket analysis and recommendation systems to fraud detection and bioinformatics. However, mining frequent itemsets from massive datasets remains computationally challenging due to high execution time and memory consumption.
Rahat Ali Shah   +7 more
wiley   +1 more source

A Patricia-Tree Approach For Frequent Closed Itemsets

open access: yes, 2007
{"references": ["J.S. Park, M.S. Chen and P.S. Yu, \"An Effective Hash Based Algorithm for Mining Association Rules,\" in Proc. 5th SIGMOD Intl. W orkshop. Management of Data, California, 1995, pp. 175-186.", "R. Agrawal and R. Srikant, \"Fast Algorithms for Mining Association\nRules. 20th Intl. Conf. Very Large Data Bases, Santiago, 1994, pp.
Moez Ben Hadj Hamida, Yahya Slimani
openaire   +2 more sources

Home - About - Disclaimer - Privacy