Sciweavers

4761 search results - page 842 / 953
» Generalizing Boundary Points
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 11 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 11 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 11 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 11 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
KDD
2005
ACM
194views Data Mining» more  KDD 2005»
14 years 11 months ago
Web object indexing using domain knowledge
Web object is defined to represent any meaningful object embedded in web pages (e.g. images, music) or pointed to by hyperlinks (e.g. downloadable files). Users usually search for...
Muyuan Wang, Zhiwei Li, Lie Lu, Wei-Ying Ma, Naiya...