Sciweavers

373 search results - page 56 / 75
» Class Separability in Spaces Reduced By Feature Selection
Sort
View
CIKM
2010
Springer
13 years 6 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 8 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
JAIR
2010
94views more  JAIR 2010»
13 years 6 months ago
Which Clustering Do You Want? Inducing Your Ideal Clustering with Minimal Feedback
While traditional research on text clustering has largely focused on grouping documents by topic, it is conceivable that a user may want to cluster documents along other dimension...
Sajib Dasgupta, Vincent Ng
EDBT
2010
ACM
184views Database» more  EDBT 2010»
13 years 9 months ago
PARINDA: an interactive physical designer for PostgreSQL
One of the most challenging tasks for the database administrator is to physically design the database to attain optimal performance for a given workload. Physical design is hard b...
Cristina Maier, Debabrata Dash, Ioannis Alagiannis...
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 7 months ago
Boosting Applied to Word Sense Disambiguation
In this paper Schapire and Singer's AdaBoost.MH boosting algorithm is applied to the Word Sense Disambiguation (WSD) problem. Initial experiments on a set of 15 selected polys...
Gerard Escudero, Lluís Màrquez, Germ...