Sciweavers

8294 search results - page 1171 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
171
Voted
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
16 years 6 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
ISMIS
1997
Springer
15 years 10 months ago
Knowledge-Based Image Retrieval with Spatial and Temporal Constructs
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
Wesley W. Chu, Alfonso F. Cardenas, Ricky K. Taira
DMIN
2009
222views Data Mining» more  DMIN 2009»
15 years 4 months ago
P-Sensitive K-Anonymity for Social Networks
-- The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in th...
Roy Ford, Traian Marius Truta, Alina Campan
WWW
2011
ACM
15 years 1 months ago
OXPath: little language, little memory, great value
Data about everything is readily available on the web—but often only accessible through elaborate user interactions. For automated decision support, extracting that data is esse...
Andrew Jon Sellers, Tim Furche, Georg Gottlob, Gio...
VIS
2008
IEEE
154views Visualization» more  VIS 2008»
16 years 7 months ago
Volume MLS Ray Casting
The method of Moving Least Squares (MLS) is a popular framework for reconstructing continuous functions from scattered data due to its rich mathematical properties and well-underst...
Christian Ledergerber, Gaël Guennebaud, Miriah ...
« Prev « First page 1171 / 1659 Last » Next »