Sciweavers

106 search results - page 14 / 22
» Finding Interesting Associations without Support Pruning
Sort
View
ICML
2006
IEEE
15 years 11 months ago
Cost-sensitive learning with conditional Markov networks
There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as conditional random fields and relational Markov networks sup...
Prithviraj Sen, Lise Getoor
119
Voted
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 1 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
IUI
2009
ACM
15 years 7 months ago
Predictive text input in a mobile shopping assistant: methods and interface design
The fundamental nature of grocery shopping makes it an interesting domain for intelligent mobile assistants. Even though the central role of shopping lists is widely recognized, r...
Petteri Nurmi, Andreas Forsblom, Patrik Flor&eacut...
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 4 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
WWW
2007
ACM
15 years 10 months ago
Extraction and classification of dense communities in the web
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
Yon Dourisboure, Filippo Geraci, Marco Pellegrini