Sciweavers

1512 search results - page 193 / 303
» Towards the Personalization of Algorithms Evaluation in Data...
Sort
View
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
KDD
2012
ACM
197views Data Mining» more  KDD 2012»
13 years 9 months ago
On the separability of structural classes of communities
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...
Bruno D. Abrahao, Sucheta Soundarajan, John E. Hop...
ENTCS
2008
118views more  ENTCS 2008»
15 years 5 months ago
Shared Hash Tables in Parallel Model Checking
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...
Jiri Barnat, Petr Rockai
CEAS
2007
Springer
16 years 22 days ago
Email Communities of Interest
Email has become an integral and sometimes overwhelming part of users’ personal and professional lives. In this paper, we measure the flow and frequency of user email toward th...
Lisa Johansen, Michael Rowell, Kevin R. B. Butler,...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 7 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram