Fast Redescription Mining Using Locality-Sensitive Hashing
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929599410077696 |
|---|---|
| author | Karjalainen, Maiju Galbrun, Esther Miettinen, Pauli |
| author_facet | Karjalainen, Maiju Galbrun, Esther Miettinen, Pauli |
| contents | Redescription mining is a data analysis technique that has found applications in diverse fields. The most used redescription mining approaches involve two phases: finding matching pairs among data attributes and extending the pairs. This process is relatively efficient when the number of attributes remains limited and when the attributes are Boolean, but becomes almost intractable when the data consist of many numerical attributes. In this paper, we present new algorithms that perform the matching and extension orders of magnitude faster than the existing approaches. Our algorithms are based on locality-sensitive hashing with a tailored approach to handle the discretisation of numerical attributes as used in redescription mining. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_04148 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fast Redescription Mining Using Locality-Sensitive Hashing Karjalainen, Maiju Galbrun, Esther Miettinen, Pauli Machine Learning Databases Redescription mining is a data analysis technique that has found applications in diverse fields. The most used redescription mining approaches involve two phases: finding matching pairs among data attributes and extending the pairs. This process is relatively efficient when the number of attributes remains limited and when the attributes are Boolean, but becomes almost intractable when the data consist of many numerical attributes. In this paper, we present new algorithms that perform the matching and extension orders of magnitude faster than the existing approaches. Our algorithms are based on locality-sensitive hashing with a tailored approach to handle the discretisation of numerical attributes as used in redescription mining. |
| title | Fast Redescription Mining Using Locality-Sensitive Hashing |
| topic | Machine Learning Databases |
| url | https://arxiv.org/abs/2406.04148 |