Sciweavers

1403 search results - page 140 / 281
» Set cover algorithms for very large datasets
Sort
View
MLDM
2005
Springer
15 years 10 months ago
CorePhrase: Keyphrase Extraction for Document Clustering
Abstract. The ability to discover the topic of a large set of text documents using relevant keyphrases is usually regarded as a very tedious task if done by hand. Automatic keyphra...
Khaled M. Hammouda, Diego N. Matute, Mohamed S. Ka...
SDM
2010
SIAM
283views Data Mining» more  SDM 2010»
15 years 6 months ago
Cascading Spatio-temporal Pattern Discovery: A Summary of Results
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...
Pradeep Mohan, Shashi Shekhar, James A. Shine, Jam...
ICRA
2007
IEEE
146views Robotics» more  ICRA 2007»
15 years 11 months ago
Crowds of Moving Objects: Navigation Planning and Simulation
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
Julien Pettré, Helena Grillon, Daniel Thalm...
AAAI
2012
13 years 7 months ago
Online Kernel Selection: Algorithms and Evaluations
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
Tianbao Yang, Mehrdad Mahdavi, Rong Jin, Jinfeng Y...
ICPR
2006
IEEE
16 years 5 months ago
The Generalized Condensed Nearest Neighbor Rule as A Data Reduction Method
In this paper, we propose a new data reduction algorithm that iteratively selects some samples and ignores others that can be absorbed, or represented, by those selected. This alg...
Bo-Han Kuo, Chien-Hsing Chou, Fu Chang