A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
SUBGRAPH WITH SET SIMILARITY IN ADATABASE
2017
Asia-pacific Journal of Convergent Research Interchange
Preserved Fulltext
To with efficiency method the SMS2 question, this paper styles a unique lattice-based index for knowledge graph, and light-weight signatures for each question vertices and knowledge vertices. supported ...
, we have a tendency to study a subgraph matching with set similarity (SMS2) question over an outsized graph information, that retrieves subgraphs that ar structurally isomorphous to the question graph ...
a lattice-based index over frequent patterns of component sets of vertices in knowledge graph G. ...
doi:10.21742/apjcri.2017.06.04
fatcat:x2x2hd3nuzadvfhkzbewjv3ssq
Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide Web
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A Web community is a highly interconnected aggregate of hubs and authorities. We define a community core to be a maximally connected bipartite subgraph of the Web graph. ...
We present preliminary experimental results obtained from real Web data that demonstrate the usefulness of FCA for improving Web search. ...
Introduction Traditional techniques for information retrieval involve text based search and various indexing methods. ...
doi:10.1007/978-3-540-32262-7_3
fatcat:3tf4ncmppjclrn7blyxjwwbk7y
Subgraph Matching with Set Similarity in a Large Graph Database
2015
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To efficiently process the SMS 2 query, this paper designs a novel lattice-based index for data graph, and lightweight signatures for both query vertices and data vertices. ...
Index Terms-subgraph matching, set similarity, graph database, index ! • Liang Hong is with the State ...
We design an efficient two-phase pruning strategy based on the lattice-based index and signature buckets to reduce the SMS 2 search space. ...
doi:10.1109/tkde.2015.2391125
fatcat:y5owepamfjfpfphbpfdnvfveua
Mining and indexing graphs for supergraph search
2013
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, we construct a lattice-like index, LW-index, to organize the selected subgraph patterns for fast index-lookup. ...
We study supergraph search (SPS), that is, given a query graph q and a graph database G that contains a collection of graphs , return graphs that have q as a supergraph from G. ...
CONCLUSION We study the problem of selecting a set of optimal features for an index in a graph database to facilitate answering supergraph search queries. ...
doi:10.14778/2536206.2536211
fatcat:bxsecoo2xzhc3ndelip6hs4uti
A multiobjective evolutionary programming framework for graph-based data mining
2013
Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Subgrap h mining is the process of identifying concep ts describing interesting and repetitive subgraphs within graph-based data. ...
In this paper, we propose a framework based on multiobjective evolutionar y programming to mine subgraphs by jointly maximizing two objectives, support and size of the extracted subgraphs. ...
Fig. 1 represents a subgraph lattice for a graph dataset G = {g 1 , g 2 , g 3 , g 4 }. ...
doi:10.1016/j.ins.2013.02.014
fatcat:v7nbthvybbdgbhsutiyxjjptmi
Three-objective subgraph mining using multiobjective evolutionary programming
2014
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The existing methods for graph-based data mining (GBDM) follow the basic approach of applying a single-objective search with a user-defined threshold to discover interesting subgraphs. ...
Two different search methods were considered with this aim, a multiobjective beam search and a multiobjective evolutionary programming (MOEP). ...
The frequent subgraph mining problem is commonly modeled using a subgraph lattice [8] . Fig. 1 represents a subgraph lattice for a toy graph dataset G = {G 1 , G 2 , G 3 }. ...
doi:10.1016/j.jcss.2013.03.005
fatcat:svsi76u235cm3jwaidsvktl7zm
Similarity Evalution between Graphs: A Formal Concept Analysis Approach
2017
Journal of Information Processing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Towards this end, this paper pioneers a novel approach for similarity evaluation between graphs based on formal concept analysis. ...
In particular, similarity evaluation between graphs is a challenging issue in many fields such as graph searching, pattern discovery, neuroscience, chemical compounds exploration and so forth. ...
Inspired by B-tree index, they devised a hybrid index for preserving the structural information. They firstly matched the important vertices of a query graph then extended it gradually. Zheng et al. ...
doi:10.3745/jips.04.0048
fatcat:mp6ysazdmzgo3d5ori7ehszcmq
Graph-Based Procedural Abstraction
2007
International Symposium on Code Generation and Optimization (CGO'07)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Compared to known PA techniques more than twice the number of instructions can be saved on a set of binaries, by detecting frequently appearing graph fragments with a graph mining tool based on the well ...
For embedded micro computers the amount of memory is still limited so code reduction is an important issue. ...
A common way of searching for frequent graph fragments is to arrange all possible subgraphs in a lattice. Fig. 6 shows a part of this lattice for the subgraphs of the DFG shown in Fig. 2 . ...
doi:10.1109/cgo.2007.14
dblp:conf/cgo/DrewekeWFSMP07
fatcat:o5rsfnv2tbc7tis75d2jg3qoha
Iterative Graph Feature Mining for Graph Indexing
2012
2012 IEEE 28th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Subgraph search is a useful and challenging query scenario for graph databases. Given a query graph q, a subgraph search algorithm returns all database graphs having q as a subgraph. ...
To efficiently implement a subgraph search, subgraph features are mined in order to index the graph database. Many subgraph feature mining approaches have been proposed. ...
Graph Boosting [14] proposes a branch and bound approach searching for graph features for classification based on the boosting algorithm. ...
doi:10.1109/icde.2012.11
dblp:conf/icde/YuanMYG12
fatcat:rqnckyclkffxbjrhhr7yvlo4ii
Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition
2010
2010 20th International Conference on Pattern Recognition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Training is based on a selection of the most efficient subgraphs using the mutual information. The detection uses dynamic programming with a lattice and thus is very fast. ...
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is automatically built. ...
For this reason, the lattice can be seen as a cascade of classifiers, where each edge stands for a micro-classifier that bases its decision on the search distance of its associated keypoint: if the added ...
doi:10.1109/icpr.2010.190
dblp:conf/icpr/RevaudLAB10
fatcat:c6gi5gaxzrgvnnpyvric2ysal4
Subgraph mining in graph-based data using multiobjective evolutionary programming
2011
2011 IEEE Congress of Evolutionary Computation (CEC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An experimental study on five synthetic and real-life graphbased datasets shows that MOEP outperforms Subdue-based methods, a well-known heuristic search approach for subgraph discovery in data mining ...
This work proposes multiobjective subgraph mining in graph-based data using multiobjective evolutionary programming (MOEP). A mined subgraph is defined by two objectives, support and size. ...
All these methods work by performing search in the subgraphs lattice. Recently, evolutionary programming based Subdue (EP-Subdue) method is applied for frequent subgraph mining [3] . ...
doi:10.1109/cec.2011.5949824
dblp:conf/cec/ShelokarQC11
fatcat:bdqy6kria5hivf6w27duflnixu
Applying the Apriori-based Graph Mining Method to Mutagenesis Data Analysis
2001
Journal of Computer Aided Chemistry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The Apriori-based graph mining method is an extension of the Apriori algorithm for association rule mining. ...
It constructs a lattice of graph nodes, in which a node at the k-th level of the lattice has k vertices and the number of supporting instances exceeds a user-specified minimum support. ...
This is because any induced subgraph of a frequent graph must be a frequent graph, due to the monotonicity of the support values in the lattice. ...
doi:10.2751/jcac.2.87
fatcat:i6wnwkbuxzgtfcvxsv3npihgti
MARGIN
2010
ACM Transactions on Knowledge Discovery from Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. ...
We propose an algorithm that mines the maximal frequent subgraphs while pruning the lattice space considerably. ...
We conceptualise the search space for finding
y
¦ q
in the form of a graph lattice. ...
doi:10.1145/1839490.1839491
fatcat:6whg44mn55bxpcsrrfwvv2zu6a
Discovery of Characteristic Subgraph Patterns Using Relative Indexing and the Cascade Model
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The cascade model is a rule induction method that uses levelwise expansion of a lattice. ...
The mining process employs two methods: relative indexing of graph vertices and the cascade model. The former extracts many linear subgraphs from the database. ...
For example, when treating chemical compounds, the edges in a graph are not ordered, and therefore we cannot give an unambiguous index between a pair of vertices. ...
doi:10.1007/3-540-45372-5_65
fatcat:tlyuz4pbnndizl73zqmeudpeke
SASUM: A Sharing-Based Approach to Fast Approximate Subgraph Matching for Large Graphs
2013
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Subgraph matching is a fundamental operation for querying graph-structured data. ...
A straightforward approach is to first generate query subgraphs of a given query graph by deleting edges and then perform exact subgraph matching for each query subgraph. ...
Several indexing based method have been developed for subgraph matching. ...
doi:10.1587/transinf.e96.d.624
fatcat:4wcz3qey6jcnze7gi2duy6ypjy
« Previous
Showing results 1 — 15 out of 3,388 results