PAMI.highUtilitySpatialPattern package
Subpackages
- PAMI.highUtilitySpatialPattern.basic package
- PAMI.highUtilitySpatialPattern.topk package
- Submodules
- PAMI.highUtilitySpatialPattern.topk.TKSHUIM module
DatasetTKSHUIMTKSHUIM.NeighboursTKSHUIM.additemset()TKSHUIM.backtrackingEFIM()TKSHUIM.calculateNeighbourIntersection()TKSHUIM.candidateCountTKSHUIM.endTimeTKSHUIM.finalPatternsTKSHUIM.getMemoryRSS()TKSHUIM.getMemoryUSS()TKSHUIM.getPatterns()TKSHUIM.getPatternsAsDataFrame()TKSHUIM.getRuntime()TKSHUIM.heapListTKSHUIM.iFileTKSHUIM.intTostrTKSHUIM.intersection()TKSHUIM.is_equal()TKSHUIM.maxMemoryTKSHUIM.memoryRSSTKSHUIM.memoryUSSTKSHUIM.minUtilTKSHUIM.mine()TKSHUIM.nFileTKSHUIM.newNamesToOldNamesTKSHUIM.oFileTKSHUIM.oldNamesToNewNamesTKSHUIM.output()TKSHUIM.printResults()TKSHUIM.save()TKSHUIM.sepTKSHUIM.sortDatabase()TKSHUIM.sort_transaction()TKSHUIM.mine()TKSHUIM.startTimeTKSHUIM.strTointTKSHUIM.tempTKSHUIM.useUtilityBinArrayToCalculateLocalUtilityFirstTime()TKSHUIM.useUtilityBinArrayToCalculateSubtreeUtilityFirstTime()TKSHUIM.useUtilityBinArraysToCalculateUpperBounds()TKSHUIM.utilityBinArrayLUTKSHUIM.utilityBinArraySU
Transactionmain()
- PAMI.highUtilitySpatialPattern.topk.abstract module
utilityPatternsutilityPatterns.endTime()utilityPatterns.finalPatterns()utilityPatterns.getMemoryRSS()utilityPatterns.getMemoryUSS()utilityPatterns.getPatterns()utilityPatterns.getPatternsAsDataFrame()utilityPatterns.getRuntime()utilityPatterns.iFile()utilityPatterns.memoryRSS()utilityPatterns.memoryUSS()utilityPatterns.nFile()utilityPatterns.oFile()utilityPatterns.printResults()utilityPatterns.save()utilityPatterns.mine()utilityPatterns.startTime()
- Module contents
Submodules
PAMI.highUtilitySpatialPattern.abstract module
- class PAMI.highUtilitySpatialPattern.abstract.utilityPatterns(iFile, nFile, minUtil, sep='\t')[source]
Bases:
ABC- Description:
This abstract base class defines the variables and methods that every frequent pattern mining algorithm must employ in PAMI
- Attributes:
- iFilestr
Input file name or path of the input file
- minUtil: integer
The user can specify minUtil either in count
- sepstr
This variable is used to distinguish items from one another in a transaction. The default seperator is tab space or . However, the users can override their default separator
- startTime:float
To record the start time of the algorithm
- endTime:float
To record the completion time of the algorithm
- finalPatterns: dict
Storing the complete set of patterns in a dictionary variable
- oFilestr
Name of the output file to store complete set of frequent patterns
- memoryUSSfloat
To store the total amount of USS memory consumed by the program
- memoryRSSfloat
To store the total amount of RSS memory consumed by the program
- Methods:
- mine()
Calling this function will start the actual mining process
- getPatterns()
This function will output all interesting patterns discovered by an algorithm
- save(oFile)
This function will store the discovered patterns in an output file specified by the user
- getPatternsAsDataFrame()
The function outputs the patterns generated by an algorithm as a data frame
- getMemoryUSS()
This function outputs the total amount of USS memory consumed by a mining algorithm
- getMemoryRSS()
This function outputs the total amount of RSS memory consumed by a mining algorithm
- getRuntime()
This function outputs the total runtime of a mining algorithm
- abstract getMemoryRSS()[source]
Total amount of RSS memory consumed by the program will be retrieved from this function
- abstract getMemoryUSS()[source]
Total amount of USS memory consumed by the program will be retrieved from this function
- abstract getPatterns()[source]
Complete set of frequent patterns generated will be retrieved from this function
- abstract getPatternsAsDataFrame()[source]
Complete set of frequent patterns will be loaded in to data frame from this function
- abstract getRuntime()[source]
Total amount of runtime taken by the program will be retrieved from this function
- abstract oFile()[source]
Variable to store the name of the output file to store the complete set of frequent patterns