AIRCC's International Journal of Computer Science and Information Technology

Bilal Hawashin ¹, Farshad Fotouhi ², William Grosky ³

Affiliations
1 Department of Computer Information Systems, Alzaytoonah University of Jordan, Amman 11733, JO
2 Department of Computer Science, Wayne State University, Detroit, MI 48202, US
3 Department of Computer and Information Science, University of Michigan-Dearborn, Dearborn, MI 48128, US

Abstract

This paper proposes an efficient similarity join method using unsupervised learning, when no labeled data is available. In our previous work, we showed that the performance of similarity join could improve when long string attributes, such as paper abstracts, movie summaries, product descriptions, and user feedback, are used under supervised learning, where a training set exists. In this work, we adopt using long string attributes during the similarity join under unsupervised learning. Along with its importance when no labeled data exists, unsupervised learning is used when no labeled data is available, it acts also as a quick preprocessing method for huge datasets. Here, we show that using long attributes during the unsupervised learning can further enhance the performance. Moreover, we provide an efficient dynamically expandable algorithm for databases with frequent transactions.

Keywords

Similarity Join, Unsupervised Learning, Diffusion Maps, Databases, Machine Learning.

Full Text