PAMI.subgraphMining.topK package

Submodules

PAMI.subgraphMining.topK.DFSCode module

class PAMI.subgraphMining.topK.DFSCode.DfsCode

Bases: object

add(ee)

containEdge(v1, v2)

copy()

getAllVLabels()

getAt(index)

getEeList()

getRightMost()

getRightMostPath()

isEmpty()

notPreOfRm(v)

onRightMostPath(v)

PAMI.subgraphMining.topK.DFSThread module

class PAMI.subgraphMining.topK.DFSThread.DfsThread(graphDb, candidates, minSup, tkgInstance)

Bases: Thread

run()

Method representing the thread’s activity.

You may override this method in a subclass. The standard run() method invokes the callable object passed to the object’s constructor as the target argument, if any, with sequential and keyword arguments taken from the args and kwargs arguments, respectively.

PAMI.subgraphMining.topK.abstract module

PAMI.subgraphMining.topK.edge module

class PAMI.subgraphMining.topK.edge.Edge(v1, v2, edgeLabel)

Bases: object

another(v)

getEdgeLabel()

PAMI.subgraphMining.topK.extendedEdge module

class PAMI.subgraphMining.topK.extendedEdge.ExtendedEdge(v1, v2, vLabel1, vLabel2, edgeLabel)

Bases: object

getEdgeLabel()

getV1()

getV2()

getVLabel1()

getVLabel2()

pairSmallerThan(x1, x2, y1, y2)

smallerThan(that)

smallerThanOriginal(that)

PAMI.subgraphMining.topK.frequentSubgraph module

class PAMI.subgraphMining.topK.frequentSubgraph.FrequentSubgraph(dfsCode, setOfGraphsIds, support)

Bases: object

PAMI.subgraphMining.topK.graph module

class PAMI.subgraphMining.topK.graph.Graph(id, vMap=None, dfsCode=None)

Bases: object

EMPTY_INTEGER_ARRAY = []

EMPTY_VERTEX_LIST = []

findAllWithLabel(targetLabel)

getAllNeighbors(v)

getAllVertices()

getEdge(v1, v2)

getEdgeCount()

getEdgeLabel(v1, v2)

getId()

getNonPrecalculatedAllVertices()

getVLabel(v)

isNeighboring(v1, v2)

precalculateLabelsToVertices()

precalculateVertexList()

precalculateVertexNeighbors()

removeInfrequentLabel(label)

PAMI.subgraphMining.topK.sparseTriangularMatrix module

class PAMI.subgraphMining.topK.sparseTriangularMatrix.SparseTriangularMatrix

Bases: object

getSupportForItems(i, j)

incrementCount(i, j)

removeInfrequentEntriesFromMatrix(minsup)

setSupport(i, j, support)

PAMI.subgraphMining.topK.tkg module

class PAMI.subgraphMining.topK.tkg.TKG(iFile, k, maxNumberOfEdges=inf, outputSingleVertices=True, outputGraphIds=False)

Bases: _TKG

DYNAMIC_SEARCH = True

EDGE_COUNT_PRUNING = True

ELIMINATE_INFREQUENT_EDGE_LABELS = True

ELIMINATE_INFREQUENT_VERTEX_PAIRS = True

ELIMINATE_INFREQUENT_VERTICES = True

class Pair(x, y)

Bases: object

THREADED_DYNAMIC_SEARCH = True

findAllOnlyOneVertex(graphDB, outputFrequentVertices)

gSpan(graphDB, outputFrequentVertices)

The main gSpan function to find frequent subgraphs. :param graphDb: The database of graphs to mine. :param outputFrequentVertices: Boolean indicating whether to output single vertices as subgraphs.

getKSubgraphs()

getMemoryRSS()

getMemoryUSS()

getMinSupport()

getQueueSize(queue)

getRuntime()

getSubgraphs()

Creates a copy of the queue’s contents without emptying the original queue.

gspanDfs(c: DfsCode, graphDB, subgraphId)

gspanDynamicDFS(c, graphDB, graphIds)

isCanonical(c: DfsCode)

readGraphs(path)

The readGraphs function reads graph data from a file and constructs a list of graphs with vertices and edges.

Parameters:

path – This method reads the graph data from the specified file and constructs a list of graphs

represented by vertices and edges :return: The readGraphs method returns a list of _ab.Graph objects, which represent graphs read from the file.

registerAsCandidate(subgraph)

removeInfrequentVertexPairs(graphDB)

rightMostPathExtensions(c, graphDB, graphIds)

rightMostPathExtensionsFromSingle(c, g)

save(oFile)

The save function writes subgraph information to a file in a specific format.

Parameters:

oFile – The oFile parameter in the save method is the file path where the output will be

saved. This method writes the subgraphs information to the specified file in a specific format

savePattern(subgraph)

startMine()

This Python function starts a mining process on a graph database, calculates runtime, pattern count, and memory usage metrics.

startThreads(graphDB, candidates, minSup)

subgraphIsomorphisms(c, g)

PAMI.subgraphMining.topK.vertex module

class PAMI.subgraphMining.topK.vertex.Vertex(id, vLabel)

Bases: object

addEdge(edge)

getEdgeList()

getId()

getLabel()

removeEdge(edgeToRemove)

Module contents