Sciweavers

478 search results - page 57 / 96
» Context-Sensitive Dependency Pairs
Sort
View
AAAI
2008
15 years 2 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
BMCBI
2006
102views more  BMCBI 2006»
14 years 12 months ago
Protein secondary structure prediction for a single-sequence using hidden semi-Markov models
Background: The accuracy of protein secondary structure prediction has been improving steadily towards the 88% estimated theoretical limit. There are two types of prediction algor...
Zafer Aydin, Yucel Altunbasak, Mark Borodovsky
KDD
2010
ACM
217views Data Mining» more  KDD 2010»
14 years 10 months ago
Mining program workflow from interleaved traces
Successful software maintenance is becoming increasingly critical due to the increasing dependence of our society and economy on software systems. One key problem of software main...
Jian-Guang Lou, Qiang Fu, Shengqi Yang, Jiang Li, ...
ICDM
2010
IEEE
273views Data Mining» more  ICDM 2010»
14 years 9 months ago
Learning Maximum Lag for Grouped Graphical Granger Models
Temporal causal modeling has been a highly active research area in the last few decades. Temporal or time series data arises in a wide array of application domains ranging from med...
Amit Dhurandhar
EMNLP
2009
14 years 9 months ago
Parser Adaptation and Projection with Quasi-Synchronous Grammar Features
We connect two scenarios in structured learning: adapting a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ano...
David A. Smith, Jason Eisner