Sciweavers

1731 search results - page 44 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
139
Voted
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 4 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
134
Voted
BMCBI
2010
137views more  BMCBI 2010»
15 years 3 months ago
Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
Michael L. Sierk, Michael E. Smoot, Ellen J. Bass,...
COCOON
2005
Springer
15 years 5 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
154
Voted
AAAI
2010
15 years 15 days ago
Multilinear Maximum Distance Embedding Via L1-Norm Optimization
Dimensionality reduction plays an important role in many machine learning and pattern recognition tasks. In this paper, we present a novel dimensionality reduction algorithm calle...
Yang Liu, Yan Liu, Keith C. C. Chan
131
Voted
JMLR
2010
119views more  JMLR 2010»
14 years 10 months ago
Semi-Supervised Learning via Generalized Maximum Entropy
Various supervised inference methods can be analyzed as convex duals of the generalized maximum entropy (MaxEnt) framework. Generalized MaxEnt aims to find a distribution that max...
Ayse Erkan, Yasemin Altun