Sciweavers

115 search results - page 21 / 23
» Summarising Data by Clustering Items
Sort
View
EDM
2009
127views Data Mining» more  EDM 2009»
13 years 6 months ago
How do Students Organize Personal Information Spaces?
The purpose of this study is to empirically reveal strategies of students' organization of learning-related digital materials within an online personal information archive. Re...
Sharon Hardof-Jaffe, Arnon Hershkovitz, Hama Abu-K...
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
14 years 9 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
CP
2003
Springer
14 years 1 months ago
Using Constraints for Exploring Catalogs
Abstract. Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data. Constraint programming has addre...
François Laburthe, Yves Caseau
ICDE
2008
IEEE
103views Database» more  ICDE 2008»
14 years 9 months ago
Processing Diagnosis Queries: A Principled and Scalable Approach
Abstract-- Many popular Web sites suffer occasional uservisible problems such as slow responses, blank pages or error messages being displayed, items not being added to shopping ca...
Shivnath Babu, Songyun Duan, Kamesh Munagala
ICML
1994
IEEE
13 years 12 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak