Год выпуска: 2011 Автор: Amr Magdy,Nagwa M. El-Makky and Noha A. Yousri Издательство: LAP Lambert Academic Publishing Страниц: 116 ISBN: 9783846524343
Описание
The huge size of a continuously flowing data has put forward a number of challenges in data stream analysis. Exploration of the structure of streamed data represented a major challenge that resulted in introducing various clustering algorithms. However, current clustering algorithms still lack the ability to efficiently discover clusters of arbitrary densities in data streams. In this thesis, a new grid-based and density-based algorithm is proposed for clustering data streams. It addresses drawbacks of recent algorithms in discovering clusters of arbitrary densities. The algorithm uses an online component to map the input data to grid cells. An offline component is then used to cluster the grid cells based on density information. Relative density relatedness measures and a dynamic range neighborhood are proposed to differentiate clusters of arbitrary densities. The experimental evaluation shows considerable improvements upon the state-of-the-art algorithms in both clustering...
Спасибо огромное. Я давно нашла Ваш сайт и пользовалась всякими полезными материалами оттуда. Не думала, что когда-нибудь буду заказывать работу, но сейчас вынуждают обстоятельства - проблемы со здоровьем.