Sciweavers

2227 search results - page 361 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
122
Voted
TNN
2010
148views Management» more  TNN 2010»
14 years 7 months ago
A fast algorithm for robust mixtures in the presence of measurement errors
Abstract--In experimental and observational sciences, detecting atypical, peculiar data from large sets of measurements has the potential of highlighting candidates of interesting ...
Jianyong Sun, Ata Kabán
91
Voted
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
16 years 1 months ago
A framework for community identification in dynamic social networks
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf, D...
104
Voted
KDD
2004
ACM
162views Data Mining» more  KDD 2004»
16 years 1 months ago
Discovering Links Between Lexical and Surface Features in Questions and Answers
Information retrieval systems, based on keyword match, are evolving to question answering systems that return short passages or direct answers to questions, rather than URLs point...
Soumen Chakrabarti
82
Voted
WSDM
2009
ACM
113views Data Mining» more  WSDM 2009»
15 years 7 months ago
Time Will Tell: Leveraging Temporal Expressions in IR
Temporal expressions, such as between 1992 and 2000, are frequent across many kinds of documents. Text retrieval, though, treats them as common terms, thus ignoring their inherent...
Irem Arikan, Srikanta J. Bedathur, Klaus Berberich
PKDD
2009
Springer
152views Data Mining» more  PKDD 2009»
15 years 7 months ago
Feature Selection for Value Function Approximation Using Bayesian Model Selection
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
Tobias Jung, Peter Stone