Sciweavers

1314 search results - page 79 / 263
» Approximate data mining in very large relational data
Sort
View
PAKDD
2010
ACM
175views Data Mining» more  PAKDD 2010»
15 years 5 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
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 2 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
JCIT
2008
165views more  JCIT 2008»
15 years 1 months ago
Mining Processes using cluster approach for representing workflows
Although much attention is being paid to business Intelligence during the past decades, the design for applying business Intelligence and particularly in a workflow processes is s...
N. P. Kavya, M. V. Sathyanarayana, N. C. Naveen
ICDE
2006
IEEE
266views Database» more  ICDE 2006»
16 years 3 months ago
Approximation Techniques for Indexing the Earth Mover's Distance in Multimedia Databases
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...
Ira Assent, Andrea Wenning, Thomas Seidl
ICDM
2006
IEEE
98views Data Mining» more  ICDM 2006»
15 years 7 months ago
What is the Dimension of Your Binary Data?
Many 0/1 datasets have a very large number of variables; however, they are sparse and the dependency structure of the variables is simpler than the number of variables would sugge...
Nikolaj Tatti, Taneli Mielikäinen, Aristides ...