Sciweavers

358 search results - page 57 / 72
» Learning from labeled and unlabeled data on a directed graph
Sort
View
WWW
2009
ACM
16 years 13 days ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
15 years 6 months ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
15 years 5 months ago
Mining Complex Time-Series Data by Learning Markovian Models
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
Yi Wang, Lizhu Zhou, Jianhua Feng, Jianyong Wang, ...
EMNLP
2004
15 years 1 months ago
Instance-Based Question Answering: A Data-Driven Approach
Anticipating the availability of large questionanswer datasets, we propose a principled, datadriven Instance-Based approach to Question Answering. Most question answering systems ...
Lucian Vlad Lita, Jaime G. Carbonell
ECAI
2000
Springer
15 years 3 months ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti