Sciweavers

735 search results - page 135 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 6 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
95
Voted
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
14 years 10 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
PAKDD
2011
ACM
245views Data Mining» more  PAKDD 2011»
14 years 2 months ago
Finding Rare Classes: Adapting Generative and Discriminative Models in Active Learning
Discovering rare categories and classifying new instances of them is an important data mining issue in many fields, but fully supervised learning of a rare class classifier is pr...
Timothy M. Hospedales, Shaogang Gong, Tao Xiang
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
15 years 6 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
DAMON
2006
Springer
15 years 3 months ago
Processing-in-memory technology for knowledge discovery algorithms
The goal of this work is to gain insight into whether processingin-memory (PIM) technology can be used to accelerate the performance of link discovery algorithms, which represent ...
Jafar Adibi, Tim Barrett, Spundun Bhatt, Hans Chal...