Sciweavers

143 search results - page 24 / 29
» How to rank with few errors
Sort
View
ICDE
2012
IEEE
238views Database» more  ICDE 2012»
13 years 2 months ago
Mining Knowledge from Data: An Information Network Analysis Approach
Abstract—Most objects and data in the real world are interconnected, forming complex, heterogeneous but often semistructured information networks. However, many database research...
Jiawei Han, Yizhou Sun, Xifeng Yan, Philip S. Yu
CIKM
2008
Springer
15 years 1 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
104
Voted
CIKM
2008
Springer
15 years 1 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles
JUCS
2006
225views more  JUCS 2006»
14 years 11 months ago
Restricting the View and Connecting the Dots - Dangers of a Web Search Engine Monopoly
: Everyone realizes how powerful the few big Web search engine companies have become, both in terms of financial resources due to soaring stock quotes and in terms of the still hid...
Narayanan Kulathuramaiyer, Wolf-Tilo Balke
POPL
2003
ACM
15 years 12 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula