A logarithmic time complexity algorithm for pattern searching using product-sum property

Authors:
Khalid Mahmood Aamir;Mujahid Abbas;Stojan Radenović
Affiliations:
Department of Computer Sciences, Rachna College of Engineering and Technology, Gujranwala, Pakistan;Center for Advanced Studies in Mathematics, Lahore University of Management Sciences, Lahore, Pakistan;Faculty of Mechanical Engineering, University of Belgrade, Kraljice Marije 16, 11 120 Beograd, Serbia
Venue:
Computers & Mathematics with Applications
Year:
2011

Citing 5
Cited 0

FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Knowledge from data using fuzzy methods

Pattern Recognition Letters - Special issue on fuzzy set technology in pattern recognition
Machine Learning

Machine Learning
Tree structure for efficient data mining using rough sets

Pattern Recognition Letters - Special issue: Rough sets, pattern recognition and data mining
Data mining from 1994 to 2004: an application-orientated review

International Journal of Business Intelligence and Data Mining

Quantified Score

Hi-index	0.12

Visualization

Abstract

Product-sum property states that an ordered pair (s"n,p"n) is unique for any ordered set a"1,a"2,...,a"n where a"i,n@?N, and s"n and p"n are the sum and product of the elements of the set, respectively. This fact has been exploited to develop an O(log(M)) time complexity algorithm for pattern searching in a large dataset, where M is the number of records in the dataset. Two potential applications (from databases and computational biology) of this property have been demonstrated to show the effectiveness and working of the proposed algorithm. The space complexity of the algorithm rises to the quadratic order.