Sciweavers

503 search results - page 98 / 101
» Mining the optimal class association rule set
Sort
View
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 2 months ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
12 years 4 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
WWW
2010
ACM
14 years 3 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
ICALP
2005
Springer
14 years 2 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
ECCC
2010
83views more  ECCC 2010»
13 years 6 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...