Sciweavers

1971 search results - page 51 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
CIKM
2003
Springer
14 years 29 days ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
SIGIR
2012
ACM
11 years 10 months ago
Mining query subtopics from search log data
Most queries in web search are ambiguous and multifaceted. Identifying the major senses and facets of queries from search log data, referred to as query subtopic mining in this pa...
Yunhua Hu, Ya-nan Qian, Hang Li, Daxin Jiang, Jian...
SNPD
2010
13 years 9 months ago
Explaining Classification by Finding Response-Related Subgroups in Data
Abstract--A method for explaining results of a regressionbased classifier is proposed. The data is clustered using a metric extracted from the classifier. This way, clusters found ...
Elina Parviainen, Aki Vehtari
CHI
2008
ACM
13 years 9 months ago
Word usage and posting behaviors: modeling blogs with unobtrusive data collection methods
We present a large-scale analysis of the content of weblogs dating back to the release of the Blogger program in 1999. Over one million blogs were analyzed from their conception t...
Adam D. I. Kramer, Kerry Rodden
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
14 years 1 months ago
An Indicator for the Number of Clusters: Using a Linear Map to Simplex Structure
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...