Sciweavers

1351 search results - page 76 / 271
» New Research Directions in Search Results Clustering
Sort
View
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
16 years 9 days ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
ASSETS
2010
ACM
15 years 1 months ago
Broadening accessibility through special interests: a new approach for software customization
Individuals diagnosed with autism spectrum disorder (ASD) often fixate on narrow, restricted interests. These interests can be highly motivating, but they can also create attentio...
Robert R. Morris, Connor R. Kirschbaum, Rosalind W...
ISNN
2011
Springer
14 years 9 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
GECCO
2000
Springer
131views Optimization» more  GECCO 2000»
15 years 9 months ago
A Genetic Algorithm with Tabu Search for Multimodal and Multiobjective Function Optimization
The integration of genetic algorithms (GAs) and tabu search is one of traditional problems in function optimization in the GA literature. However, most proposed methods have utili...
Setsuya Kurahashi, Takao Terano
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
16 years 7 days ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho