Sciweavers

81 search results - page 7 / 17
» Mining top-n local outliers in large databases
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 2 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
14 years 7 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
TFS
2011
242views Education» more  TFS 2011»
14 years 4 months ago
Linguistic Summarization Using IF-THEN Rules and Interval Type-2 Fuzzy Sets
—Linguistic summarization (LS) is a data mining or knowledge discovery approach to extract patterns from databases. Many authors have used this technique to generate summaries li...
Dongrui Wu, Jerry M. Mendel
88
Voted
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
15 years 9 months ago
Entity categorization over large document collections
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
Arnd Christian König, Rares Vernica, Venkates...
CIKM
2009
Springer
15 years 4 months ago
Agglomerating local patterns hierarchically with ALPHA
To increase the relevancy of local patterns discovered from noisy relations, it makes sense to formalize error-tolerance. Our starting point is to address the limitations of state...
Loïc Cerf, Pierre-Nicolas Mougel, Jean-Fran&c...