Search
Now showing items 1-10 of 30
Approximation to expected support of frequent itemsets in mining probabilistic sets of uncertain data
(Elsevier, 2015)
Knowledge discovery and data mining generally discovers implicit, previously unknown, and useful knowledge from data. As one of the popular knowledge discovery and data mining tasks, frequent itemset mining, in particular, ...
Edge-based mining of frequent subgraphs from graph streams
(Elsevier, 2015)
In the current era of Big data, high volumes of valuable data can be generated at a high velocity from high-varieties of data sources in various real-life applications ranging from sensor networks to social networks, from ...
Frequent subgraph mining from streams of linked graph structured data
(CEUR Workshop Proceedings, 2015)
Nowadays, high volumes of high-value data (e.g., semantic web data) can be generated and published at a high velocity. A collection of these data can be viewed as a big, interlinked, dynamic graph structure of linked ...
A data analytic algorithm for managing, querying, and processing uncertain big data in cloud environments
(MDPI, 2015-12)
Big data are everywhere as high volumes of varieties of valuable precise and uncertain data can be easily collected or generated at high velocity in various real-life applications. Embedded in these big data are rich sets ...
Effectively and efficiently mining frequent patterns from dense graph streams on disk
(Elsevier, 2014)
In this paper, we focus on dense graph streams, which can be generated in various applications ranging from sensor networks to social networks, from bio-informatics to chemical informatics. We also investigate the problem ...
Tightening upper bounds to the expected support for uncertain frequent pattern mining
(Elsevier, 2014)
Due to advances in technology, high volumes of valuable data can be collected and transmitted at high velocity in various scientific and engineering applications. Consequently, efficient data mining algorithms are in demand ...
Mining of diverse social entities from linked data
(CEUR Workshop Proceedings, 2014)
Nowadays, high volumes of valuable data can be easily generated or collected from various data sources at high velocity. As these data are often related or linked, they form a web of linked data. Examples include semantic ...
Frequent pattern mining from dense graph streams
(CEUR Workshop Proceedings, 2014)
As technology advances, streams of data can be produced in many applications such as social networks, sensor networks, bioinformatics, and chemical informatics. These kinds of streaming data share a property in common--namely, ...
Sports data mining: predicting results for the college football games
(Elsevier, 2014)
In many real-life sports games, spectators are interested in predicting the outcomes and watching the games to verify their predictions. Traditional approaches include subjective prediction, objective prediction, and simple ...
A tree-based algorithm for mining diverse social entities
(Elsevier, 2014)
DiSE-growth, a tree-based (pattern-growth) algorithm for mining DIverse Social Entities, is proposed and experimentally assessed in this paper. The algorithm makes use of a specialized data structure, called DiSE-tree, for ...