Sciweavers

1314 search results - page 252 / 263
» Approximate data mining in very large relational data
Sort
View
IJFCS
2008
102views more  IJFCS 2008»
14 years 11 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
101
Voted
ICWSM
2009
14 years 9 months ago
Targeting Sentiment Expressions through Supervised Ranking of Linguistic Configurations
User generated content is extremely valuable for mining market intelligence because it is unsolicited. We study the problem of analyzing users' sentiment and opinion in their...
Jason S. Kessler, Nicolas Nicolov
119
Voted
CVPR
2009
IEEE
15 years 6 months ago
On compositional Image Alignment, with an application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
Brian Amberg, Andrew Blake, Thomas Vetter
110
Voted
FOCS
2008
IEEE
15 years 6 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
ICCS
2001
Springer
15 years 4 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow