Sciweavers

89 search results - page 12 / 18
» Exploiting Dataset Similarity for Distributed Mining
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 8 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
PAKDD
2010
ACM
175views Data Mining» more  PAKDD 2010»
13 years 11 months ago
EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs
Abstract. We report a surprising, persistent pattern in large sparse social graphs, which we term EigenSpokes. We focus on large Mobile Call graphs, spanning about 186K nodes and m...
B. Aditya Prakash, Ashwin Sridharan, Mukund Seshad...
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
14 years 8 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson
VLDB
1999
ACM
140views Database» more  VLDB 1999»
13 years 12 months ago
Distributed Hypertext Resource Discovery Through Examples
We describe the architecture of a hypertext resource discovery system using a relational database. Such a system can answer questions that combine page contents, metadata, and hyp...
Soumen Chakrabarti, Martin van den Berg, Byron Dom
CIKM
2008
Springer
13 years 9 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao