Knowedu: A system to construct knowledge graph for education

P Chen, Y Lu, VW Zheng, X Chen, B Yang - Ieee Access, 2018 - ieeexplore.ieee.org
Motivated by the vast applications of knowledge graph and the increasing demand in
education domain, we propose a system, called KnowEdu, to automatically construct …

FPGA/GPU-based acceleration for frequent itemsets mining: A comprehensive review

L Bustio-Martínez, R Cumplido, M Letras… - ACM Computing …, 2021 - dl.acm.org
In data mining, Frequent Itemsets Mining is a technique used in several domains with
notable results. However, the large volume of data in modern datasets increases the …

Accelerated frequent closed sequential pattern mining for uncertain data

T You, Y Sun, Y Zhang, J Chen, P Zhang… - Expert Systems with …, 2022 - Elsevier
Data uncertainty has been taken into a consideration for mining and discovery of its hidden
knowledge in a variety of applications. Due to the fact that the nature of closed sequences is …

Mining frequent itemsets over uncertain databases

Y Tong, L Chen, Y Cheng, PS Yu - arXiv preprint arXiv:1208.0292, 2012 - arxiv.org
In recent years, due to the wide applications of uncertain data, mining frequent itemsets over
uncertain databases has attracted much attention. In uncertain databases, the support of an …

Efficient algorithms for mining high-utility itemsets in uncertain databases

JCW Lin, W Gan, P Fournier-Viger, TP Hong… - Knowledge-Based …, 2016 - Elsevier
High-utility itemset mining (HUIM) is a useful set of techniques for discovering patterns in
transaction databases, which considers both quantity and profit of items. However, most …

Mining weighted frequent sequences in uncertain databases

MM Rahman, CF Ahmed, CKS Leung - Information Sciences, 2019 - Elsevier
Frequent pattern mining has become very useful and interesting to researchers due to its
high applicability. Different real-life databases (eg, sensor network, medical diagnosis data) …

Clustering large probabilistic graphs

G Kollios, M Potamias, E Terzi - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
We study the problem of clustering probabilistic graphs. Similar to the problem of clustering
standard graphs, probabilistic graph clustering has numerous applications, such as finding …

Efficient mining of frequent item sets on large uncertain databases

L Wang, DWL Cheung, R Cheng… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
The data handled in emerging applications like location-based services, sensor monitoring
systems, and data integration, are often inexact in nature. In this paper, we study the …

An online pricing mechanism for mobile crowdsensing data markets

Z Zheng, Y Peng, F Wu, S Tang, G Chen - Proceedings of the 18th ACM …, 2017 - dl.acm.org
Although data has become an important kind of commercial goods, there are few
appropriate online platforms to facilitate the trading of mobile crowd-sensed data so far. In …

Clustering big spatiotemporal-interval data

W Shao, FD Salim, A Song… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
We propose a model for clustering data with spatiotemporal intervals. This model is used to
effectively evaluate clusters of spatiotemporal interval data. A new energy function is used to …