Sciweavers

2099 search results - page 387 / 420
» Similarity for Conceptual Querying
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 4 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
15 years 4 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic
78
Voted
WEBI
2009
Springer
15 years 4 months ago
Towards Bridging the Web and the Semantic Web
The World Wide Web (WWW) has provided us with a plethora of information. However, given its unstructured format, this information is useful mainly to humans and cannot be effectiv...
Swarnim Kulkarni, Doina Caragea
PETRA
2009
ACM
15 years 4 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
COMPGEOM
2006
ACM
15 years 3 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir