Frequent subtree mining–an overview

Y Chi, RR Muntz, S Nijssen… - Fundamenta Informaticae, 2005 - content.iospress.com
Mining frequent subtrees from databases of labeled trees is a new research field that has
many practical applications in areas such as computer networks, Web mining …

Complex networks and simple models in biology

E de Silva, MPH Stumpf - Journal of the Royal Society …, 2005 - royalsocietypublishing.org
The analysis of molecular networks, such as transcriptional, metabolic and protein
interaction networks, has progressed substantially because of the power of models from …

[图书][B] The algorithm design manual

SS Skiena - 1998 - Springer
This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

A survey of frequent subgraph mining algorithms

C Jiang, F Coenen, M Zito - The Knowledge Engineering Review, 2013 - cambridge.org
Graph mining is an important research area within the domain of data mining. The field of
study concentrates on the identification of frequent subgraphs within graph data sets. The …

Change distilling: Tree differencing for fine-grained source code change extraction

B Fluri, M Wursch, M PInzger… - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
A key issue in software evolution analysis is the identification of particular changes that
occur across several versions of a program. We present change distilling, a tree differencing …

Implementation of a large-scale optimal power flow solver based on semidefinite programming

DK Molzahn, JT Holzer, BC Lesieutre… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
The application of semidefinite programming to the optimal power flow (OPF) problem has
recently attracted significant research interest. This paper provides advances in modeling …

Speqnets: Sparsity-aware permutation-equivariant graph networks

C Morris, G Rattan, S Kiefer… - … on Machine Learning, 2022 - proceedings.mlr.press
While message-passing graph neural networks have clear limitations in approximating
permutation-equivariant functions over graphs or general relational data, more expressive …

[图书][B] MIMO-OFDM for LTE, WiFi and WiMAX: Coherent versus non-coherent and cooperative turbo transceivers

L Hanzo, Y Akhtman, L Wang, M Jiang - 2010 - books.google.com
MIMO-OFDM for LTE, WIFI and WIMAX: Coherent versus Non-Coherent and Cooperative
Turbo-Transceivers provides an up-to-date portrayal of wireless transmission based on …

Feature diagrams and logics: There and back again

K Czarnecki, A Wasowski - 11th International Software Product …, 2007 - ieeexplore.ieee.org
Feature modeling is a notation and an approach for modeling commonality and variability in
product families. In their basic form, feature models contain mandatory/optional features …

[PDF][PDF] Short study of t-neutrosophic tree-width

T Fujita - preprint (researchgate), 2024 - researchgate.net
A graph parameter is a numerical value assigned to a graph that describes specific
structural properties, such as size or connectivity. A” graph width parameter” measures the …