Sciweavers

1836 search results - page 6 / 368
» Mining Clustering Dimensions
Sort
View
SISAP
2010
IEEE
91views Data Mining» more  SISAP 2010»
13 years 2 months ago
Dimension reduction for distance-based indexing
Rui Mao, Willard L. Miranker, Daniel P. Miranker
ICDM
2009
IEEE
176views Data Mining» more  ICDM 2009»
13 years 5 months ago
SISC: A Text Classification Approach Using Semi Supervised Subspace Clustering
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
Mohammad Salim Ahmed, Latifur Khan
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
EDBT
2010
ACM
170views Database» more  EDBT 2010»
13 years 10 months ago
Augmenting OLAP exploration with dynamic advanced analytics
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
Benjamin Leonhardi, Bernhard Mitschang, Rubé...
AUSAI
2007
Springer
14 years 1 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan