Search Results

The Length Constrained K–Drones Rural Postman Problem (LC K–DRPP) is a continuous optimization problem where a set of curved or straight lines of a network have to be traversed, in order to be serviced, by a fleet of homogeneous drones, with total ...

Mining of colossal patterns is used to mine patterns in databases with many attributes and values, but the number of instances in each database is small. Although many efficient approaches for extracting colossal patterns have been proposed, they ...

• We ponder over the problem of high utility itemset mining algorithm with negative item value and length constrains.
• We proposed a high utility itemset mining algorithm with negative utility values using a pattern-growth approach.
• ...

High utility itemsets (HUIs) mining is one of the emerging topics in frequent itemset mining (FIM). HUIs mining provides more informative and actionable information compared to FIM. Although many HUIs mining algorithms have been proposed in ...

Pattern matching with wildcards is a challenging topic in many domains, such as bioinformatics and information retrieval. This paper focuses on the problem with gap-length constraints and the one-off condition (The one-off condition means that each ...