- 學位論文
使用上線學習並結合雙樹堆和乘法權重更新演算法實現動態搜尋最佳化
Dynamic Search Optimization: Double Treaps and MWU Algorithm for Efficient Online Learning
摘要
隨著數位資料的快速增長，搜尋演算法的效率與可擴展性變得愈發重要。傳統方法經常難以在速度與資源效率之間取得平衡，尤其是在包含不同頻率元素的大型且複雜的數據集上。本文提出了一種新的方法，通過結合隨機化與上線學習樹堆結構以及乘法權重更新（MWU）演算法來優化文字搜尋效能。其主要目標是在不論單詞熱門程度的情況下，提升搜尋速度並減少資源消耗。我們的方法利用乘法權重更新演算法在學習樹堆和隨機樹堆之間做動態選擇，確保搜尋效率。實驗結果顯示，與其他方法相比，我們的方法顯著縮短了搜尋時間。此方法能有效適應單詞頻率的變化，對於大規模數據集具有較強的適應性。總之，結合隨機化與學習樹堆以及乘法權重更新演算法，為各種應用中的搜尋效能優化提供了一個具有潛力的解決方案。
並列摘要
The rapid growth of digital data necessitates efficient and scalable search algorithms. Traditional methods often struggle with balancing speed and resource efficiency, particularly in large and complex datasets with varying element frequencies. This paper proposes a new approach to optimize word search performance by integrating randomized and learned treaps with the Multiplicative Weights Update (MWU) algorithm. The primary objective is to enhance the speed of word searches while minimizing resource usage, regardless of the words' popularity or obscurity. Our method leverages the MWU algorithm to dynamically select between the learned treap and the randomized treap, ensuring efficient searches. Experimental results demonstrate that our approach significantly reduces search times compared to other methods. The proposed method effectively adapts to the frequency of words, making it robust for diverse and large-scale datasets. In conclusion, integrating randomized and learned treaps with the MWU algorithm offers a promising solution for optimizing search performance in various applications, paving the way for future enhancements in search algorithms.