Sciweavers

1314 search results - page 125 / 263
» Approximate data mining in very large relational data
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
138
Voted
CORR
2011
Springer
185views Education» more  CORR 2011»
14 years 8 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
130
Voted
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 5 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...
160
Voted
SIGIR
2005
ACM
15 years 7 months ago
Automatic web query classification using labeled and unlabeled training data
Accurate topical categorization of user queries allows for increased effectiveness, efficiency, and revenue potential in general-purpose web search systems. Such categorization be...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...
APBC
2004
122views Bioinformatics» more  APBC 2004»
15 years 3 months ago
Evolution of Relative Synonymous Codon Usage in Human Immunodeficiency Virus Type 1
Mutation in HIV-1 is extremely rapid, a consequence of a low-fidelity viral reverse transcription process. The envelope gene has been shown to accumulate substitutions at a rate o...
Peter L. Meintjes, Allen G. Rodrigo