Поиск по каталогу |
(строгое соответствие)
|
- Профессиональная
- Научно-популярная
- Художественная
- Публицистика
- Детская
- Искусство
- Хобби, семья, дом
- Спорт
- Путеводители
- Блокноты, тетради, открытки
OBJECT CLASSIFICATION USING FAST SUPERVISED HASHING FOR HIGH DIMENSIONAL DATA.
В наличии
Местонахождение: Алматы | Состояние экземпляра: новый |
Бумажная
версия
версия
Автор: M.Aravind Kumar
ISBN: 9786206172918
Год издания: 1905
Формат книги: 60×90/16 (145×215 мм)
Количество страниц: 72
Издательство: LAP LAMBERT Academic Publishing
Цена: 25571 тг
Положить в корзину
Способы доставки в город Алматы * комплектация (срок до отгрузки) не более 2 рабочих дней |
Самовывоз из города Алматы (пункты самовывоза партнёра CDEK) |
Курьерская доставка CDEK из города Москва |
Доставка Почтой России из города Москва |
Аннотация: This book summarizes The primary concern of supervised hashing is to convert the original features into short binary codes that can maintain label similarity in the Hamming space. Due to their strong generalization capabilities, non-linear hash functions have shown to be superior than linear ones. Kernel functions are frequently utilized in the literature to create non-linear hashing, which results in encouraging retrieval performance but long evaluation and training times. Here, we suggest using boosted decision trees, which are quick to train and assess and are hence more suited for hashing with high dimensional data. As part of continuous improvement, we first suggest sub-modular formulations for the hashing binary code inference issue as well as an effective block search technique based on Graph Cut for large-scale inference. Then, we train boosted decision trees to suit the binary codes in order to learn hash functions. Experiments show that in terms of retrieval precision and training duration, our suggested strategy greatly surpasses the majority of state-of-the-art methods.
Ключевые слова: hashing, kernel, high dimension, training and testing