| عنوان فارسی مقاله: | درختان تصمیم گیری برای جریان های داده کاوی مبتنی بر کرانMcDiarmid |
| عنوان انگلیسی مقاله: |
Decision Trees for Mining Data Streams Based on the McDiarmid’s Bound |
چکیده
1.مقدمه
1.1انگیزه و نتایج
1.2 درخت های تصمیم گیری برای داده های بدون جریان
1.3 درختان تصمیم گیری برای جریان داده و نابرابری Hoeffding
3.کران MCDIARMIDبرای بدست آوری اطلاعات
4.کران MCDIARMIDبرای شاخص Gini
5. الگوریتم درخت MCDIARMID
6. نتایج تجربی
7. سخن آخر
کلمات کلیدی :
[PDF]Lecture 7. Data Stream Mining. Building decision treeswww.lsi.upc.edu/~gavalda/DataStreamSeminar/files/Lecture7.pdfFinding in what sense data is not random. For example: frequently repeated patterns, correlations among attributes, one attribute being predictable from others, . . . Fix a description language a priori, and show that data has a description more concise than the data itself. 4 / 26 ...The CART decision tree for mining data streams - ResearchGatehttps://www.researchgate.net/.../260212465_The_CART_decision_tree_for_mining_data...Request (PDF) | The CART decision tr... | One of the most popular tools for mining data streams are decision trees. In this paper we propose a new algorithm, which is based on the commonly known CART algorithm. The most important task in constructing decision trees for data streams is to determine the best attribute to ...[PDF]FLEXIBLE NEURO-FUZZY SYSTEMSwww.cs.put.poznan.pl/sigml/wp-content/uploads/2013/11/Leszek-Rutkowski.pdffor MINING DATA STREAMS. Leszek Rutkowski, Lena Pietruczuk, Piotr Duda, Maciej Jaworski, Decision Trees for Mining. Data Streams Based on the McDiarmid's Bound, IEEE Transactions on Knowledge and. Data Engineering, vol. 25, no. 6, pp. 1272–1279, 2013. Leszek Rutkowski, Maciej Jaworski, Lena Pietruczuk, ...