Scalable Data Mining
Scalable Data Mining is a subfield of data mining that focuses on the design and analysis of algorithms and systems whose computational and storage requirements grow at most linearly (or near-linearly) with data size, thereby enabling efficient extraction of patterns from very large and high-dimensional datasets, often in parallel or distributed environments.
2.5K
Publications
249.2K
Citations
5.6K
Authors
1.6K
Institutions
Publications per year
2017–2026
679
2.5K
Data mining: concepts and techniques
Jiawei Han, Micheline Kamber · Choice Reviews Online · 2012 · 28.9K citations
Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998 · 10.8K citations
R. K. Agrawal, Ramakrishnan Srikant · 2002 · 5.1K citations
Tian Zhang, Raghu Ramakrishnan, Miron Livny · 1996 · 3.9K citations
1–5 of 2.5K
5.6K
28
h-index
23
h-index
23
h-index
20
h-index
Western Norway University of Applied Sciences, Norway
22 publications · 1.1K citations
19
h-index
1–5 of 5.6K
1.6K
University of Illinois Urbana-Champaign
Urbana, United States
30 h-index
71 publications
48.1K citations
Simon Fraser University
Burnaby, Canada
28 h-index
76 publications
39.8K citations

Harbin Institute of Technology
Harbin, China
26 h-index
55 publications
3.7K citations
Carnegie Mellon University
Pittsburgh, United States
26 h-index
76 publications
10.7K citations

Sejong University
Seoul, South Korea
25 h-index
82 publications
3.5K citations
IBM (United States)
Armonk, United States
24 h-index
59 publications
15.2K citations

University of Minnesota
Minneapolis, United States
22 h-index
55 publications
7K citations
Stanford University
Stanford, United States
21 h-index
47 publications
11.3K citations
1–8 of 1.6K
TKDE · 63 publications · 9K citations
41
h-index
58 publications · 8.3K citations
35
h-index
59 publications · 2.5K citations
31
h-index
47 publications · 3K citations
29
h-index
PVLDB · 34 publications · 3.7K citations
25
h-index
1–5