Sciweavers

4560 search results - page 366 / 912
» Finding Data in the Neighborhood
Sort
View
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 7 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 7 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
148
Voted
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
16 years 4 months ago
Tagging Human Knowledge
A fundamental premise of tagging systems is that regular users can organize large collections for browsing and other tasks using uncontrolled vocabularies. Until now, that premise...
Paul Heymann, Andreas Paepcke, Hector Garcia-Molin...
CHI
2010
ACM
16 years 1 months ago
A case study of micro-blogging in the enterprise: use, value, and related issues
This is a case study about the early adoption and use of micro-blogging in a Fortune 500 company. The study used several independent data sources: five months of empirical micro-b...
Jun Zhang, Yan Qu, Jane Cody, Yulingling Wu
HICSS
2008
IEEE
88views Biometrics» more  HICSS 2008»
16 years 1 months ago
An Analysis of Korean National Information Strategy of IT839
Recently, the Korean government launched the IT839 project with the objective of converting Korea into a ubiquitous information society. This study investigates the role of the Ko...
Dong Hee Shin, Won-Yong Kim