Accelerating the LZ-complexity algorithm

Ratsaby, Joel; Timashkov, Alexander

doi:10.1109/icpads60453.2023.00038

2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS) 2023

DOI: 10.1109/icpads60453.2023.00038

|View full text |Cite

Accelerating the LZ-complexity algorithm

Joel Ratsaby,

Alexander Timashkov

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Other1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Multi-GPU Processing of Unstructured Data for Machine Learning

Ratsaby,

Timashkov

2024

ISC High Performance 2024 Research Paper Proceedings (39th International Conference)

Self Cite

View full text Add to dashboard Cite

We introduce a method for processing unstructured data for machine learning based on an LZ-complexity string distance. Computing the LZ-complexity is inherently a serial data compression process; hence, we introduce a string distance computed by a parallel algorithm that utilizes multiple GPU devices to process unstructured data, which typically exists in large quantities. We use this algorithm to compute a distance matrix representation of the unstructured data that standard learning algorithms can use to learn. Our approach eliminates the need for human-based feature definition or extraction. Except for some simple data reformatting done manually, our proposed approach operates on the original raw data and is fully automatic. The parallel computation of the distance matrix is efficient. It obtains a speed-up factor of 528 in computing the distance matrix between every possible pair of 16 strings of length 1M bytes. We show that for learning time-series classification, relative to the ubiquitous TFIDF data representation, the distancematrix representation yields a higher learning accuracy for most of a broad set of learning algorithms. Thus, the parallel algorithm can be helpful in efficiently and accurately learning from unstructured data.

show abstract

Multi-GPU Processing of Unstructured Data for Machine Learning

Ratsaby,

Timashkov

2024

ISC High Performance 2024 Research Paper Proceedings (39th International Conference)

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Accelerating the LZ-complexity algorithm

Cited by 1 publication

References 15 publications

Multi-GPU Processing of Unstructured Data for Machine Learning

Multi-GPU Processing of Unstructured Data for Machine Learning

Contact Info

Product

Resources

About