Sciweavers

1414 search results - page 136 / 283
» Relational peculiarity-oriented mining
Sort
View
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
14 years 10 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...
ICDM
2006
IEEE
107views Data Mining» more  ICDM 2006»
14 years 4 months ago
Improving Grouped-Entity Resolution Using Quasi-Cliques
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular,...
Byung-Won On, Ergin Elmacioglu, Dongwon Lee, Jaewo...
ADMA
2006
Springer
150views Data Mining» more  ADMA 2006»
14 years 4 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 ...
SAC
2004
ACM
14 years 3 months ago
Knowledge discovery from doctor-patient relationship
The relationship between doctors and their patients is gaining more and more importance in the health care providing. It determines the compliance of the treatment and a part of t...
Jesús S. Aguilar-Ruiz, Raquel Costa, Federi...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
14 years 1 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...