新規登録 | ログイン | FAQ

[?]

CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Recent | Unread | Search | Authors | Tags | Export

A probabilistic learning approach for document indexing

by: Norbert Fuhr, Chris Buckley

ACM Trans. Inf. Syst., Vol. 9, No. 3. (July 1991), pp. 223-248.

View FullText article

ACM, DOI

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

rayzhang, pprett

Find related articles with these CiteULike tags

connectionist, document, indexing, information, ir, learning, model, probabilistic, retrieval

BibTeX record

RIS record

pprett's tags

All tags in pprett's library

Filter:

2002 2005 access activation active adaboost adaboostmh adaboostmr adaptive aggregation algorithm ambiguity analysis analytical anc ann aol aposdle approximation architecture association associative assumption award back-propagation bam bayesian behavior bellkor binary bm25 bns bookmarking boostexter boosting bowtie bregman bursty c45 cart categorization cbir cdf challenges class classical classification clickthrough clustering coding collaborative collective collocation complex-networks compression computational computer confidence connectionist content-based context contextual corpus cost-sensitive crf cup data data_analysis database decision-making design detection deviation-from-randomness dfo dfr diameter difficulty dimensionality distribution divergences document duplicate ecir2007 efficiency efficient eigenvector e-learning emergent-semantics empirical engines entity evaluation evolution examination excite expansion experimentation explicite extensive f4 factor fagin feature feedback fields filtering fitting folksonomy formulation foundation framework genetic geographical gibbs global goals goodness-of-fit google grammar graph heavy-tail hits human ide iir image imbalanced implicit incremental independence index indexing infap inference information inquery intelligence intelligent_surfer intent interaction interactive inverted ir item-based judgements kdd kld kpca language laplacian latent lda learning learning2rank lemur length letor limited linguistics link listwise local log logistic logs lsa lsi machine margin maxent maximum-likelihood mcmc mds mercure mg million mining missing ml model modeling models msr multiplicative named nature nbc ndcg near netflix network networks neural n-gram nips nlp nltk nmf normalization objectrank okapi one-sided_selection ontology optimal optimization ordering over_sampling overview own pagerank parameters pareto parsing pattern pca performance permurank personalization pioneering pircs platform plsa pointwise pooling pos power-law ppv preference principle probabilistic probability propability_distribution propagation proximity-search pscheir pseudo python query query-log querys querz rank rankboost ranking rankingsvm ranknet rare rdd real-time rebalancing recognition recommender reduction reformulating regression reinforcement relations relevanc relevance relevancy re-rank retrieval retrospective ria roc rocchio routing rule-based rules sa sampling scale-free scipy search selection selectional semantic semantics sematic seminal semi-supervised set sets shallow sigir sigir2008 significants simple simulation slm small-world smoothing social spam spectral spotsigs spreading springer statap statistical streams structure study supervised survey svd svm svmmap systems tag taxonomy term terrier text textbook textmining theoretic theoretical theory thesis threshold tool topic topic-sensitive topk training transformation transient trec trustrank tutorial uncertainty under_sampling update usage user values voting vsm web web_characterization web-graph weight weighting weka wordnet workshop wta www yahoo zipf zoning