Добро пожаловать в клуб

Показать / Спрятать  Домой  Новости Статьи Файлы Форум Web ссылки F.A.Q. Логобург    Показать / Спрятать

       
Поиск   
Главное меню
ДомойНовостиСтатьиПостановка звуковФайлыКнижный мирФорумСловарьРассылкаКаталог ссылокРейтинг пользователейЧаВо(FAQ)КонкурсWeb магазинКарта сайта

Поздравляем!
Поздравляем нового Логобуржца surikovaa со вступлением в клуб!

Реклама

КНИЖНЫЙ МИР

Data Mining Techniques For Concisely Representing Patterns Sets   Tarek Hamrouni

Data Mining Techniques For Concisely Representing Patterns Sets

236 страниц. 2011 год.
LAP Lambert Academic Publishing
This book focuses on mining frequent itemsets and association rules. A detailed study we carry out shows that closed itemsets and minimal generators play a key role in concisely representing patterns sets. However, an intra-class combinatorial redundancy would logically results from the inherent absence of a unique minimal generator associated to a given closed itemset. In this respect, we propose lossless reductions of the minimal generator set thanks to a new substitution- based process. Our theoretical results will then be extended to the association rule framework. We also lead a thorough exploration of the disjunctive search space, where itemsets are characterized by their respective disjunctive supports, instead of the conjunctive ones. In order to obtain a redundancy-free representation of the disjunctive search space, an interesting solution consists in selecting a unique element to represent itemsets covering the same set of data. We then introduce a new...
 
- Генерация страницы: 0.04 секунд -