Sciweavers

1544 search results - page 134 / 309
» Data Mining and Database Systems: Where is the Intersection
Sort
View
DATESO
2008
129views Database» more  DATESO 2008»
15 years 7 months ago
Database Engineering from the Category Theory Viewpoint
Abstract. This paper gives an overview of XML formal models, summarizes database engineering practices, problems and their evolution. We focus on categorical aspects of XML formal ...
David Toth
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 6 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
KDD
2005
ACM
181views Data Mining» more  KDD 2005»
16 years 6 months ago
Evaluating similarity measures: a large-scale study in the orkut social network
Online information services have grown too large for users to navigate without the help of automated tools such as collaborative filtering, which makes recommendations to users ba...
Ellen Spertus, Mehran Sahami, Orkut Buyukkokten
PKDD
2009
Springer
95views Data Mining» more  PKDD 2009»
16 years 18 days ago
Non-redundant Subgroup Discovery Using a Closure System
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functio...
Mario Boley, Henrik Grosskreutz
SIGMOD
1997
ACM
113views Database» more  SIGMOD 1997»
15 years 9 months ago
Size Separation Spatial Join
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
Nick Koudas, Kenneth C. Sevcik