From Machine Learning to Data Mining
Zhengxin Chen
- 24 Nov 1999
3
TL;DR: Conducted research on social media analysis and engagement, user modeling from social media, social collaboration tools, web task models and intelligent browsing, web automaton and testing.
read more
Abstract: Conducted research on social media analysis and engagement, user modeling from social media, social collaboration tools, web task models and intelligent browsing, web automaton and testing.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Enhanced Rough Sets Rule Reduction Algorithm for Classification Digital Mammography
TL;DR: The experimental results show that the classification algorithm performs well, reaching over 93% in accuracy with less number of rules compared with well-known decision trees and neural network classifier models.
16
Preprocessing of Clinical Databases to improve classification accuracy of patient diagnosis
TL;DR: A systematic preprocessing procedure is applied to a known septic shock patient database and classification results are compared with previous studies and show that the preprocessing is crucial to improve classifiers accuracy.
7
Web i̇stati̇sti̇kleri̇nde maki̇ne öğrenmesi̇ algori̇tmalari i̇le kri̇ti̇k parametre tespi̇ti̇
Harun Bayer,Tevfik Çoban +1 more
TL;DR: In this paper, a web sitelerinin internet ziyaretcileri tarafindaki yansimasi ile olusan web sitesi istatistiklerinin bu sektordeki onemi artmaktadir, bu degerler butununun ag trafiginde anlamlandirilabilabilabilmesi icin siniflandirma veya kumeleme islemlerine tabi tutulmasi gerekmektedir.
References
Mining association rules between sets of items in large databases
Rakesh Agrawal,Tomasz Imielinski,Arun N. Swami +2 more
- 01 Jun 1993
TL;DR: An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
•Proceedings Article
Fast algorithms for mining association rules
Rakesh Agrawal,Ramakrishnan Srikant +1 more
- 01 Jul 1998
TL;DR: Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.
Mining quantitative association rules in large relational tables
Ramakrishnan Srikant,Rakesh Agrawal +1 more
- 01 Jun 1996
TL;DR: This work deals with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary and introduces measures of partial completeness which quantify the information lost due to partitioning.
1.7K
•Proceedings Article
Mining Generalized Association Rules
Ramakrishnan Srikant,Rakesh Agrawal +1 more
- 11 Sep 1995
TL;DR: In this paper, the problem of mining generalized association rules was introduced, where each transaction consists of a set of items, and a taxonomy (is-a hierarchy) on the items, finding associations between items at any level of the taxonomy.
•Proceedings Article
Sampling Large Databases for Association Rules
Hannu Toivonen
- 03 Sep 1996
TL;DR: New algorithms that reduce the database activity considerably by picking a Random sample, to find using this sample all association rules that probably hold in the whole database, and then to verify the results with the rest of the database.
Related Papers (5)
Heikki Mannila
- 01 Jan 1996
Zhenhang Wang,Xiaomeng Wei,Jilin Yang +2 more
- 17 Jul 2019
Dominique Lord,Xiao Qin,Srinivas R. Geedipally +2 more
- 01 Jan 2021