1314 search results - page 70 / 263 » Approximate data mining in very large relational data |
103
click to vote
NN
2006
Springer
15 years 1 months ago
2006
Springer
We introduce the Hierarchically Growing Hyperbolic Self-Organizing Map (H2 SOM) featuring two extensions of the HSOM (hyperbolic SOM): (i) a hierarchically growing variant that al...
141
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
128
click to vote
IDA
2009
Springer
14 years 11 months ago
2009
Springer
In the last decade, Social Network Analysis has been a field in which the effort devoted from several researchers in the Data Mining area has increased very fast. Among the possibl...
122
click to vote
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
117
click to vote
VLDB
1998
ACM
15 years 5 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...