Sciweavers

5595 search results - page 465 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CAINE
2009
15 years 5 months ago
Clustering Customer Transactions: A Rough Set Based Approach
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
Arunava Saha, Darsana Das, Dipanjan Karmakar, Dili...
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 9 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
16 years 7 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
PAKDD
2010
ACM
198views Data Mining» more  PAKDD 2010»
16 years 11 days ago
A Better Strategy of Discovering Link-Pattern Based Communities by Classical Clustering Methods
Abstract. The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was pr...
Chen-Yi Lin, Jia-Ling Koh, Arbee L. P. Chen
TKDE
2008
231views more  TKDE 2008»
15 years 7 months ago
Personalized Concept-Based Clustering of Search Engine Queries
A major problem of current Web search is that search queries are usually short and ambiguous, and thus are insufficient for specifying the precise user needs. To alleviate this pro...
Kenneth Wai-Ting Leung, Wilfred Ng, Dik Lun Lee