Sciweavers

2227 search results - page 262 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
EDBT
2006
ACM
129views Database» more  EDBT 2006»
16 years 3 months ago
Efficient Quantile Retrieval on Multi-dimensional Data
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Man Lung Yiu, Nikos Mamoulis, Yufei Tao
119
Voted
IDA
2010
Springer
15 years 2 months ago
Selecting the Links in BisoNets Generated from Document Collections
According to Koestler, the notion of a bisociation denotes a connection between pieces of information from habitually separated domains or categories. In this paper, we consider a ...
Marc Segond, Christian Borgelt
142
Voted
ADMA
2006
Springer
150views Data Mining» more  ADMA 2006»
15 years 9 months ago
Web Scale Competitor Discovery Using Mutual Information
Abstract. The web with its rapid expansion has become an excellent resource for gathering information and people’s opinion. A company owner wants to know who is the competitor, a...
Rui Li, Shenghua Bao, Jin Wang, Yuanjie Liu, Yong ...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 4 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
149
Voted
ALT
1994
Springer
15 years 7 months ago
Program Synthesis in the Presence of Infinite Number of Inaccuracies
Most studies modeling inaccurate data in Gold style learning consider cases in which the number of inaccuracies is finite. The present paper argues that this approach is not reaso...
Sanjay Jain