Sciweavers

362 search results - page 56 / 73
» Discovering Interesting Holes in Data
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 3 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
90
Voted
VLDB
1999
ACM
188views Database» more  VLDB 1999»
15 years 2 months ago
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
TREC
2007
14 years 11 months ago
Drexel at TREC 2007: Question Answering
The TREC Question Answering Track presented several distinct challenges to participants in 2007. Participants were asked to create a system which discovers the answers to factoid ...
Protima Banerjee, Hyoil Han
80
Voted
IVS
2006
131views more  IVS 2006»
14 years 10 months ago
Understanding the dynamics of collaborative multi-party discourse
In this paper, we discuss the efforts underway at the Pacific Northwest National Laboratory in understanding the dynamics of multi-party discourse across a number of communication...
Andrew J. Cowell, Michelle L. Gregory, Joe Bruce, ...
DKE
2007
129views more  DKE 2007»
14 years 10 months ago
First-order temporal pattern mining with regular expression constraints
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting seque...
Sandra de Amo, Daniel A. Furtado