Results 21 to 30 of about 4,248,745 (299)
Approximation of Probabilistic Maximal Frequent Itemset Mining Over Uncertain Sensed Data
Event detection by discovering frequent itemsets is very popular in sensor network communities. However, the recorded data is often a probability rather than a determined value in a really productive environment as sensed data is often affected by noise.
Sheng Chen +4 more
doaj +1 more source
Parallel Incremental Mining of Regular-Frequent Patterns from WSNs Big Data [PDF]
Efficient regular-frequent pattern mining from sensors-produced data has become a challenge. The large volume of data leads to prolonged runtime, thus delaying vital predictions and decision makings which need an immediate response.
Sadegh Rahmani-Boldaji +2 more
doaj +1 more source
An N-List-Based Approach for Mining Frequent Inter-Transaction Patterns
Mining frequent inter-transaction patterns (ITPs) from large databases is both useful and of interest. Since frequent inter-transaction patterns (FITPs) are discovered across transactions in a transaction database (TD), the number of patterns is very ...
Thanh-Ngo Nguyen +4 more
doaj +1 more source
An Optimization of Closed Frequent Subgraph Mining Algorithm
Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism.
Demetrovics J. +3 more
doaj +1 more source
Seizure related injuries – Frequent injury patterns, hospitalization and therapeutic aspects
Purpose: Epileptic seizures frequently result in distinct physical injuries, fractures, traumatic brain injuries and minor trauma. The aim of this study was to retrospectively determine the frequent injury patterns due to seizure episode and to analyze ...
Nils Mühlenfeld +6 more
doaj +1 more source
A New Fast Vertical Method for Mining Frequent Patterns [PDF]
Vertical mining methods are very effective for mining frequent patterns and usually outperform horizontal mining methods. However, the vertical methods become ineffective since the intersection time starts to be costly when the cardinality of tidset (tid-
Zhihong Deng, Zhonghui Wang
doaj +1 more source
Reducing the Frequent Pattern Set [PDF]
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent paper [7] we have shown that an MDL-based approach gives a dramatic reduction of the number of frequent item sets to consider.
Bathoorn, R.W. +2 more
openaire +3 more sources
Representing Graphs as Bag of Vertices and Partitions for Graph Classification
Graph classification is a difficult task because finding a good feature representation for graphs is challenging. Existing methods use topological metrics or local subgraphs as features, but the time complexity for finding discriminatory subgraphs or ...
Mansurul Bhuiyan, Mohammad Al Hasan
doaj +1 more source
Discovering Self-reliant Periodic Frequent Patterns
Periodic frequent pattern discovery is a non-trivial task for analysing databases to reveal the recurring shapes of patterns’ occurrences. Though significant strides have been made in their discovery for understanding large databases in decision-making ...
John Wondoh +7 more
core +1 more source
Graph-based discovery of ontology change patterns [PDF]
Ontologies can support a variety of purposes, ranging from capturing conceptual knowledge to the organisation of digital content and information. However, information systems are always subject to change and ontology change management can pose challenges.
Abgaz, Yalemisew +3 more
core +2 more sources

