Merge pull request #564 from LasyaPalla/main

Updated few changes in the files according to inspection profiles

Author: vanithakattumuri

PAMI/AssociationRules/basic/_ARWithLift.py

@@ -394,7 +394,7 @@ def printResults(self) -> None:
         if len(_ab._sys.argv) == 5:
             _ap = ARWithLift(_ab._sys.argv[1], float(_ab._sys.argv[3]), _ab._sys.argv[4])
         if len(_ab._sys.argv) == 4:
-            _ap = ARWithLift(_ab._sys.argv[1], _ab._sys.argv[3],sep='\t')
+            _ap = ARWithLift(_ab._sys.argv[1], float(_ab._sys.argv[3]),sep='\t')
         _ap.mine()
         _ap.mine()
         print("Total number of Association Rules:", len(_ap.getPatterns()))

PAMI/AssociationRules/basic/_RuleMiner.py

@@ -75,7 +75,7 @@ def _generation(self, prefix, suffix):
         :type suffix: str
         """
         if len(suffix) == 1:
-            conf = self._generaeWithConfidence(prefix, suffix[0])
+            self._generaeWithConfidence(prefix, suffix[0])
         for i in range(len(suffix)):
             suffix1 = suffix[:i] + suffix[i+1:]
             prefix1 = prefix + ' ' + suffix[i]
@@ -223,7 +223,7 @@ def _generation(self, prefix, suffix):
         :type suffix: str
         """
         if len(suffix) == 1:
-            conf = self._generateWithLeverage(prefix, suffix[0])
+            self._generateWithLeverage(prefix, suffix[0])
         for i in range(len(suffix)):
             suffix1 = suffix[:i] + suffix[i+1:]
             prefix1 = prefix + ' ' + suffix[i]
@@ -263,7 +263,7 @@ def run(self):
             suffix = self._singleItems[:i] + self._singleItems[i+1:]
             prefix = self._singleItems[i]
             for j in range(i+1, len(self._singleItems)):
-                conf = self._generateWithLeverage(self._singleItems[i], self._singleItems[j])
+                self._generateWithLeverage(self._singleItems[i], self._singleItems[j])
             self._generation(prefix, suffix)
 
 class RuleMiner:
@@ -547,7 +547,7 @@ def printResults(self):
         if len(_ab._sys.argv) == 6:
             _ap = RuleMiner(_ab._sys.argv[1], _ab._sys.argv[3], float(_ab._sys.argv[4]), _ab._sys.argv[5])
         if len(_ab._sys.argv) == 5:
-            _ap = RuleMiner(_ab._sys.argv[1], _ab._sys.argv[3], _ab._sys.argv[4],sep='\t')
+            _ap = RuleMiner(_ab._sys.argv[1], _ab._sys.argv[3], float(_ab._sys.argv[4]),sep='\t')
         _ap.mine()
         _ap.mine()
         print("Total number of Association Rules:", len(_ap.getPatterns()))

PAMI/AssociationRules/basic/leverage.py

@@ -145,7 +145,7 @@ class leverage:
     _memoryRSS = float()
     _associationRules = {}
 
-    def __init__(self, iFile, minLev, sep, maxTS):
+    def __init__(self, iFile, minLev, maxTS, sep):
         """
         :param iFile: input file name or path
         :type iFile: str
@@ -339,11 +339,11 @@ def printResults(self):
 
 if __name__ == "__main__":
     _ap = str()
-    if len(_ab._sys.argv) == 4 or len(_ab._sys.argv) == 5:
+    if len(_ab._sys.argv) == 5 or len(_ab._sys.argv) == 6:
+        if len(_ab._sys.argv) == 6:
+            _ap = leverage(_ab._sys.argv[1], float(_ab._sys.argv[3]), int(_ab._sys.argv[4]),_ab._sys.argv[5])
         if len(_ab._sys.argv) == 5:
-            _ap = leverage(_ab._sys.argv[1], float(_ab._sys.argv[3]), _ab._sys.argv[4])
-        if len(_ab._sys.argv) == 4:
-            _ap = leverage(_ab._sys.argv[1], _ab._sys.argv[3],sep='\t')
+            _ap = leverage(_ab._sys.argv[1],float(_ab._sys.argv[3]),int(_ab.sys.argv[4]),sep='\t')
         _ap.mine()
         _ap.mine()
         print("Total number of Association Rules:", len(_ap.getAssociationRules()))

PAMI/contiguousFrequentPattern/basic/PositionMining.py

@@ -32,16 +32,16 @@
 
 
 import pandas as pd
-import numpy as np
-import math
-from PAMI.contiguousFrequentPattern import abstract as _ab
+#import numpy as np
+#import math
+from PAMI.contiguousFrequentPattern.basic import abstract as _ab
 from deprecated import deprecated
 
 
 class Node:
     def __init__(self,symbol,leaf=False):
         self._val=symbol
-        self.children=[None for i in range(26)]
+        self.children=[None for _ in range(26)]
         self.leaf=leaf
         self.freq={}
         self.count=1
@@ -125,7 +125,7 @@ def getfreqs(self):
 
         temp={}
         for i in self.symbol_freq:
-            if(len(self.symbol_freq[i])>=self.min_sup):
+            if len(self.symbol_freq[i])>=self.min_sup:
                 temp.update({i:self.symbol_freq[i]})
         self.symbol_freq=temp
 
@@ -151,8 +151,8 @@ def getPatternsAsDataFrame(self):
         :rtype: pd.DataFrame
         """
 
-        dataFrame = {}
-        data = []
+        #dataFrame = {}
+        #data = []
         seqs=[]
         sup=[]
         for i in self.frequentPatterns:
@@ -245,22 +245,22 @@ def join(self,db,length):
         """
         for seq1 in db:
             for seq2 in db:
-                if(seq1!=seq2):
-                    if(length==1):
+                if seq1!=seq2:
+                    if length==1:
                         word=seq1+seq2
                         # print(seq1,seq2,db[seq1],db[seq2])
                         minus_1={i-1 for i in db[seq2]}
                         positions=db[seq1].intersection(minus_1)
-                        if(len(positions)>=self.min_sup):
+                        if len(positions)>=self.min_sup:
                             self.table[length+1].update({word:positions})
 
 
                     else:
-                        if(seq1[1:]== seq2[:-1]):
+                        if seq1[1:]== seq2[:-1]:
                             word=seq1+seq2[-1]
                             minus_1={i-1 for i in db[seq2]}
                             positions=db[seq1].intersection(minus_1)
-                            if(len(positions)>=self.min_sup):
+                            if len(positions)>=self.min_sup:
                                 self.table[length+1].update({word:positions})
 
 

PAMI/correlatedPattern/basic/CoMine.py

@@ -268,7 +268,7 @@ def _creatingItemSets(self) -> None:
                     quit()
 
 
-    def _convert(self, value: Union[int, float, str]) -> None:
+    def _convert(self, value: Union[int, float, str]):
         """
         To convert the type of user specified minSup value
 
@@ -357,7 +357,7 @@ def recursive(self, item, nodes, root):
         itemNodes = {}
         for transaction, count in transactions:
             transaction = [i for i in transaction if i in itemCounts]
-            transaction = sorted(transaction, key=lambda item: itemCounts[item], reverse=True)
+            transaction = sorted(transaction, key=lambda _item: itemCounts[_item], reverse=True)
             node = newRoot
             for item in transaction:
                 node = node.addChild(item, count)

PAMI/correlatedPattern/basic/CoMinePlus.py

@@ -268,7 +268,7 @@ def _creatingItemSets(self) -> None:
                     quit()
 
 
-    def _convert(self, value: Union[int, float, str]) -> None:
+    def _convert(self, value: Union[int, float, str]):
         """
         To convert the type of user specified minSup value
 
@@ -351,7 +351,7 @@ def recursive(self, item, nodes, root):
         itemNodes = {}
         for transaction, count in transactions:
             transaction = [i for i in transaction if i in itemCounts]
-            transaction = sorted(transaction, key=lambda item: itemCounts[item], reverse=True)
+            transaction = sorted(transaction, key=lambda _item: itemCounts[_item], reverse=True)
             node = newRoot
             for item in transaction:
                 node = node.addChild(item, count)
@@ -417,7 +417,7 @@ def mine(self) -> None:
                         nitemsCounts[trans] = 0
                     nitemsCounts[trans] += count
 
-            nitemsCounts = {k:v for k, v in nitemsCounts.items() if v <= bound and v >= self._minSup}
+            nitemsCounts = {k:v for k, v in nitemsCounts.items() if bound >= v >= self._minSup}
             nitemNode = {}
             for transaction, count in ntransactions:
                 temp = []

PAMI/correlatedPattern/basic/_CoMine.py

@@ -195,7 +195,7 @@ def createHeaderList(self, mapSupport: Dict[int, int], minSup: int) -> None:
         for x, y in mapSupport.items():
             if y >= minSup:
                 t1.append(x)
-        itemSetBuffer = [k for k, v in sorted(mapSupport.items(), key=lambda x: x[1], reverse=True)]
+        itemSetBuffer = [k for k, v in sorted(mapSupport.items(), key=lambda _x: _x[1], reverse=True)]
         self.headerList = [i for i in t1 if i in itemSetBuffer]
 
     def addPrefixPath(self, prefix: List['_Node'], mapSupportBeta, minSup) -> None:
@@ -438,7 +438,7 @@ def _saveItemSet(self, prefix, prefixLength, support) -> None:
         self._itemSetCount += 1
         self._finalPatterns[tuple(l)] = [support, all_conf]
 
-    def _convert(self, value: Union[int, float, str]) -> None:
+    def _convert(self, value: Union[int, float, str]) -> float | int | str:
         """
         To convert the type of user specified minSup value
 
@@ -530,8 +530,7 @@ def _correlatedPatternGrowthGenerate(self, correlatedPatternTree, prefix, prefix
                     mapSupportBeta = {}
                     while path is not None:
                         if path.parent.itemId != -1:
-                            prefixPath = []
-                            prefixPath.append(path)
+                            prefixPath = [path]
                             pathCount = path.counter
                             parent1 = path.parent
                             while parent1.itemId != -1:

PAMI/coveragePattern/basic/CMine.py

@@ -58,7 +58,8 @@
 
 from PAMI.coveragePattern.basic import abstract as _ab
 from typing import List, Dict, Tuple, Set, Union, Any, Generator
-from deprecated import deprecated
+from deprecation import deprecated
+
 
 class CMine(_ab._coveragePatterns):
     """
@@ -177,7 +178,8 @@ class CMine(_ab._coveragePatterns):
     _lno = 0
 
 
-    def _convert(self, value) -> Union[int, float]:
+    @staticmethod
+    def _convert(value) -> Union[int, float]:
         """
         To convert the user specified minSup value
 
@@ -255,7 +257,7 @@ def tidToBitset(self,item_set: Dict[str, int]) -> Dict[str, int]:
 
         :param item_set:
         :return: Dictionary
-        :rtype: dict
+        :rtype: dict[str,int]
         """
         bitset = {}
 
@@ -265,7 +267,7 @@ def tidToBitset(self,item_set: Dict[str, int]) -> Dict[str, int]:
             for i in range(1,len(v)):
                 diff = int(v[i]) - int(v[i-1])
                 bitset[k] = (bitset[k] << diff) | 0b1
-            bitset[k] = (bitset[k] << (self._lno - int(v[i])))
+            bitset[k] = (bitset[k] << (self._lno - int(v[-1])))
         return bitset
 
     def genPatterns(self,prefix: Tuple[str, int],tidData: List[Tuple[str, int]]) -> None:
@@ -397,8 +399,8 @@ def getPatterns(self) -> Dict[str, int]:
         """
         Function to send the set of coverage patterns after completion of the mining process
 
-        :return: returning coverage patterns
-        :rtype: dict
+        :return: Dictionary of patterns and their support counts.
+        :rtype: Dict[str, int]
         """
         return self._finalPatterns
 

PAMI/coveragePattern/basic/CPPG.py

@@ -256,7 +256,8 @@ def _updateDatabases(self, dict1: Dict[str, List[str]]) -> List[List[str]]:
             list2.append([i for i in dict1 if i in list1])
         return list2
 
-    def _buildProjectedDatabase(self, data: List[List[str]], info: List[str]) -> Dict[str, List[List[str]]]:
+    @staticmethod
+    def _buildProjectedDatabase(data: List[List[str]], info: List[str]) -> Dict[str, List[List[str]]]:
         """ To construct the projected database for each prefix
         :param data: list of transactions with support per prefix
         :type data: list
@@ -328,7 +329,8 @@ def _savePeriodic(self, itemSet: List[str]) -> str:
             t1 = t1 + self._rankedUp[i] + "\t"
         return t1
 
-    def _convert(self, value: Union[int, float, str]) -> Union[int, float]:
+    @staticmethod
+    def _convert(value: Union[int, float, str]) -> Union[int, float]:
         """
         To convert the given user specified value
 

PAMI/extras/calculateMISValues/usingBeta.py

@@ -32,12 +32,15 @@
      You should have received a copy of the GNU General Public License
      along with this program.  If not, see <https://www.gnu.org/licenses/>.
 """
-import sys as _sys
+
+import sys
+#import sys as _sys
+from typing import Union
 import pandas as _pd
 import validators as _validators
 from urllib.request import urlopen as _urlopen
 
-class usingBeta():
+class usingBeta:
     """
 
     :Description: This code is used to calculate multiple minimum support of items in the the given database. Output can be stored in file or as as dataframe.
@@ -69,7 +72,7 @@ class usingBeta():
     _LS: int = int()
     _finalPatterns: dict = {}
 
-    def __init__(self, iFile: str, beta: int, LS: int, sep: str="\t"):
+    def __init__(self, iFile: Union[str, _pd.DataFrame], beta: int, LS: int, sep: str="\t"):
         self._iFile = iFile
         self._beta = beta
         self._LS = LS
@@ -84,9 +87,9 @@ def _creatingItemSets(self) -> None:
         self._Database = []
         self._mapSupport = {}
         if isinstance(self._iFile, _pd.DataFrame):
-            if self._iFile.empty:
+            if not self._iFile:
                 print("its empty..")
-            i = self._iFile.columns.values.tolist()
+            i = self._iFile.columns.tolist()
             if 'Transactions' in i:
                 self._Database = self._iFile['Transactions'].tolist()
 
@@ -110,7 +113,7 @@ def _creatingItemSets(self) -> None:
                 except IOError:
                     print("File Not Found")
 
-    def _creatingFrequentItems(self) -> tuple:
+    def _creatingFrequentItems(self):
         """
         This function creates frequent items from _database.
         :return: frequentTidData that stores frequent items and their tid list.
@@ -168,6 +171,6 @@ def save(self, outFile: str) -> None:
 
 
 if __name__ == '__main__':
-  cd = usingBeta(sys.argv[1], sys.argv[3], sys.argv[4], sys.argv[5])
+  cd = usingBeta(sys.argv[1], int(sys.argv[3]), int(sys.argv[4]), sys.argv[5])
   cd.calculateMIS()
   cd.save(sys.argv[2])