Search Results for author:
Found 7 papers, 0 papers with code
BigCarl: Mining frequent subnets from a single large Petri net
While there have been lots of work studying frequent subgraph mining, very rare publications have discussed frequent subnet mining from more complicated data structures such as Petri nets.
PSpan:Mining Frequent Subnets of Petri Nets
This paper proposes for the first time an algorithm PSpan for mining frequent complete subnets from a set of Petri nets.
On Semi-Supervised Multiple Representation Behavior Learning
SSMRBL is an incremental learning process that can learn more than one representation, which is an appropriate solution for dealing with the scarce of labeled training data in the age of big data and with the heavy workload of learning compound structured labels.
Knowledge-guided Unsupervised Rhetorical Parsing for Text Summarization
Automatic text summarization (ATS) has recently achieved impressive performance thanks to recent advances in deep learning and the availability of large-scale corpora.
Attributed Rhetorical Structure Grammar for Domain Text Summarization
We have also shown that the knowledge based approach may be made more powerful by introducing grammar parsing and RST as inference engine.
Locality preserving projection on SPD matrix Lie group: algorithm and analysis
Our work is based on the fact that the set of all SPD matrices with the same size has a Lie group structure, and we aim to transform the manifold learning to the SPD matrix Lie group.
Applying Ricci Flow to High Dimensional Manifold Learning
Traditional manifold learning algorithms often bear an assumption that the local neighborhood of any point on embedded manifold is roughly equal to the tangent space at that point without considering the curvature.
