BibSLEIGH — Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining

Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining
KDD, 2002.

KER

@proceedings{KDD-2002,
	address       = "Edmonton, Alberta, Canada",
	isbn          = "1-58113-567-X",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining}",
	year          = 2002,
}

Contents (88 items)

KDD-2002-RidgewayM #analysis #dataset: Bayesian analysis of massive datasets via particle filters (GR, DM), pp. 5–13.
KDD-2002-AlqallafKMZ #correlation #data mining #mining #robust #scalability: Scalable robust covariance and correlation estimates for data mining (FAA, KPK, RDM, RHZ), pp. 14–23.
KDD-2002-BennettME #algorithm #kernel #modelling #named: MARK: a boosting algorithm for heterogeneous kernel models (KPB, MM, MJE), pp. 24–31.
KDD-2002-TanKS: Selecting the right interestingness measure for association patterns (PNT, VK, JS), pp. 32–41.
KDD-2002-BucilaGKW #algorithm #constraints #named: DualMiner: a dual-pruning algorithm for itemsets with constraints (CB, JG, DK, WMW), pp. 42–51.
KDD-2002-TuzhilinL #multi #query #set: Querying multiple sets of discovered rules (AT, BL), pp. 52–60.
KDD-2002-RichardsonD #mining: Mining knowledge-sharing sites for viral marketing (MR, PMD), pp. 61–70.
KDD-2002-Zaki #mining: Efficiently mining frequent trees in a forest (MJZ), pp. 71–80.
KDD-2002-PalmerGF #data mining #graph #mining #named #performance #scalability: ANF: a fast and scalable tool for data mining in massive graphs (CRP, PBG, CF), pp. 81–90.
KDD-2002-Kleinberg: Bursty and hierarchical structure in streams (JMK), pp. 91–101.
KDD-2002-KeoghK #benchmark #data mining #empirical #metric #mining #on the #overview: On the need for time series data mining benchmarks: a survey and empirical demonstration (EJK, SK), pp. 102–111.
KDD-2002-StolteTH #analysis #query #using #visualisation: Query, analysis, and visualization of hierarchically structured data using Polaris (CS, DT, PH), pp. 112–122.
KDD-2002-WalterR #interactive #on the #using #visualisation: On interactive visualization of high-dimensional data using the hyperbolic plane (JAW, HJR), pp. 123–132.
KDD-2002-Joachims #optimisation #using: Optimizing search engines using clickthrough data (TJ), pp. 133–142.
KDD-2002-AndersonDW #adaptation #markov #modelling #navigation #relational #web: Relational Markov models and their application to adaptive web navigation (CRA, PMD, DSW), pp. 143–152.
KDD-2002-ChudovaS #markov #sequence: Pattern discovery in sequences under a Markov assumption (DC, PS), pp. 153–162.
KDD-2002-Aggarwal #classification #effectiveness #on the #string: On effective classification of strings with wavelets (CCA), pp. 163–172.
KDD-2002-Agarwal: Shrinkage estimator generalizations of Proximal Support Vector Machines (DKA), pp. 173–182.
KDD-2002-TantrumMS #clustering #dataset #modelling #scalability: Hierarchical model-based clustering of large datasets through fractionation and refractionation (JT, AM, WS), pp. 183–190.
KDD-2002-DhillonMK #classification #clustering #word: Enhanced word clustering for hierarchical text classification (ISD, SM, RK), pp. 191–200.
KDD-2002-KruengkraiJ #algorithm #classification #learning #parallel: A parallel learning algorithm for text classification (CK, CJ), pp. 201–206.
KDD-2002-WuPLL #approach #categorisation #refinement: A refinement approach to handling model misfit in text categorization (HW, THP, BL, XL), pp. 207–216.
KDD-2002-EvfimievskiSAG #mining #privacy: Privacy preserving mining of association rules (AVE, RS, RA, JG), pp. 217–228.
KDD-2002-LiuPWH #mining #set: Mining frequent item sets by opportunistic projection (JL, YP, KW, JH), pp. 229–238.
KDD-2002-YuHC #classification #learning #named #using #web: PEBL: positive example based learning for Web page classification using SVM (HY, JH, KCCC), pp. 239–248.
KDD-2002-EsterKS #mining #web: Web site mining: a new way to spot competitors, customers and suppliers in the world wide web (ME, HPK, MS), pp. 249–258.
KDD-2002-PednaultAZ #learning: Sequential cost-sensitive decision making with reinforcement learning (EPDP, NA, BZ), pp. 259–268.
KDD-2002-SarawagiB #interactive #learning #using: Interactive deduplication using active learning (SS, AB), pp. 269–278.
KDD-2002-Iyengar #constraints #privacy: Transforming data to satisfy privacy constraints (VSI), pp. 279–288.
KDD-2002-BennettDM: Exploiting unlabeled data in ensemble methods (KPB, AD, RM), pp. 289–296.
KDD-2002-JoshiAK #predict #question: Predicting rare classes: can boosting make any weak learner strong? (MVJ, RCA, VK), pp. 297–306.
KDD-2002-KolczSK #classification #performance #random: Efficient handling of high-dimensional feature spaces by randomized classifier ensembles (AK, XS, JKK), pp. 307–313.
KDD-2002-El-RamlySS #approach #behaviour #mining #runtime: From run-time behavior to usage scenarios: an interaction-pattern mining approach (MER, ES, PGS), pp. 315–324.
KDD-2002-StoreyC #modelling #optimisation: Exploiting response models: optimizing cross-sell and up-sell opportunities in banking (AS, MDC), pp. 325–331.
KDD-2002-RossetNEVI #modelling: Customer lifetime value modeling and its use for customer retention planning (SR, EN, UE, NV, YI), pp. 332–340.
KDD-2002-MorinagaYTF #mining #web: Mining product reputations on the Web (SM, KY, KT, TF), pp. 341–349.
KDD-2002-TejadaKM #identification #independence #learning #string: Learning domain-independent string transformation weights for high accuracy object identification (ST, CAK, SM), pp. 350–359.
KDD-2002-WeissV #realtime: A system for real-time competitive market intelligence (SMW, NKV), pp. 360–365.
KDD-2002-JulischD #detection #mining: Mining intrusion detection alarms for actionable knowledge (KJ, MD), pp. 366–375.
KDD-2002-MahoneyC #detection #learning #modelling #network #novel: Learning nonstationary models of normal network traffic for detecting novel attacks (MVM, PKC), pp. 376–385.
KDD-2002-SequeiraZ #data mining #mining #named: ADMIT: anomaly-based data mining for intrusions (KS, MJZ), pp. 386–395.
KDD-2002-TuzhilinA #analysis #array #scalability: Handling very large numbers of association rules in the analysis of microarray data (AT, GA), pp. 396–404.
KDD-2002-AntalGF #clustering #learning #network #on the: On the potential of domain literature for clustering and Bayesian network learning (PA, PG, GF), pp. 405–414.
KDD-2002-LiangK #mining #network: Mining heterogeneous gene expression data with time lagged recurrent neural networks (YL, AK), pp. 415–421.
KDD-2002-Aggarwal02a #case study #collaboration #crawling #experience #mining #resource management #topic #user interface: Collaborative crawling: mining user experiences for topical resource discovery (CCA), pp. 423–428.
KDD-2002-AyresFGY #mining #representation #using: Sequential PAttern mining using a bitmap representation (JA, JF, JG, TY), pp. 429–435.
KDD-2002-BeilEX #clustering: Frequent term-based text clustering (FB, ME, XX), pp. 436–442.
KDD-2002-Ben-DavidGS #data flow #framework #learning: A theoretical framework for learning from a pool of disparate data sources (SBD, JG, RS), pp. 443–449.
KDD-2002-BinghamMS #topic: Topics in 0--1 data (EB, HM, JKS), pp. 450–455.
KDD-2002-Boz #network: Extracting decision trees from trained neural networks (OB), pp. 456–461.
KDD-2002-ChenHS #algorithm: A new two-phase sampling based algorithm for discovering association rules (BC, PJH, PS), pp. 462–468.
KDD-2002-ChungC #clustering #cvs #information retrieval #named: CVS: a Correlation-Verification based Smoothing technique on information retrieval and term clustering (CYC, BC), pp. 469–474.
KDD-2002-CohenR #clustering #integration #learning #scalability #set: Learning to match and cluster large high-dimensional data sets for data integration (WWC, JR), pp. 475–480.
KDD-2002-DobraG #algorithm #linear #named #scalability: SECRET: a scalable linear regression tree algorithm (AD, JG), pp. 481–487.
KDD-2002-Eliassi-RadCA: Tina Eliassi-Rad, Terence Critchlow, Ghaleb Abdulla (TER, TC, GA), pp. 488–494.
KDD-2002-FangHL #identification #using: Tumor cell identification using features rules (BF, WH, MLL), pp. 495–500.
KDD-2002-FragoudisML #classification: Integrating feature and instance selection for text classification (DF, DM, SL), pp. 501–506.
KDD-2002-Frigui #approach #clustering #identification #named #performance #scalability #set: SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets (HF), pp. 507–512.
KDD-2002-GodboleSC #multi #scalability #using: Scaling multi-class support vector machines using inter-class confusion (SG, SS, SC), pp. 513–518.
KDD-2002-HoNN #process #visualisation: Visualization support for a user-centered KDD process (TBH, TDN, DN), pp. 519–524.
KDD-2002-HultenD #constant #database #mining #modelling #scalability: Mining complex models from arbitrarily large databases in constant time (GH, PMD), pp. 525–531.
KDD-2002-JagannathanNAH: A model for discovering customer value for E-content (SJ, JN, KCA, MH), pp. 532–537.
KDD-2002-JehW #named #similarity: SimRank: a measure of structural-context similarity (GJ, JW), pp. 538–543.
KDD-2002-JinLS #similarity: Similarity measure based on partial information of time series (XJ, YL, CS), pp. 544–549.
KDD-2002-KeoghLC #database #linear: Finding surprising patterns in a time series database in linear time and space (EJK, SL, BYcC), pp. 550–556.
KDD-2002-KumarPW #clustering #fault: Clustering seasonality patterns in the presence of errors (MK, NRP, JW), pp. 557–563.
KDD-2002-LiTS #classification #robust #set: Construct robust rule sets for classification (JL, RWT, HS), pp. 564–569.
KDD-2002-LiB #algorithm #classification: Instability of decision tree classification algorithms (RHL, GGB), pp. 570–575.
KDD-2002-LinLCY #data mining #database #distributed #mining #transaction: Distributed data mining in a chain store database of short transactions (CRL, CHL, MSC, PSY), pp. 576–581.
KDD-2002-LinC #algorithm #clustering #performance #robust #self: A robust and efficient clustering algorithm based on cohesion self-merging (CRL, MSC), pp. 582–587.
KDD-2002-LinH #documentation #web: Discovering informative content blocks from Web documents (SHL, JMH), pp. 588–593.
KDD-2002-LittleJLRS #data mining #mining: Collusion in the U.S. crop insurance program: applied data mining (BBL, WLJ, ACL, RMR, SAS), pp. 594–598.
KDD-2002-LiuL #adaptation #classification #documentation #incremental #mining: Incremental context mining for adaptive document classification (RLL, YLL), pp. 599–604.
KDD-2002-Olecka #classification #performance: Evaluating classifiers’ performance in a constrained environment (AO), pp. 605–612.
KDD-2002-PantelL #word: Discovering word senses from text (PP, DL), pp. 613–619.
KDD-2002-RaskuttiFK #classification #clustering #using: Combining clustering and co-training to enhance text classification using unlabelled data (BR, HLF, AK), pp. 620–625.
KDD-2002-UedaS #category theory #detection #modelling #multi #parametricity #using: Single-shot detection of multiple categories of text using parametric mixture models (NU, KS), pp. 626–631.
KDD-2002-UgurelKG #automation #classification #source code #what: What’s the code?: automatic classification of source code archives (SU, RK, CLG), pp. 639–644.
KDD-2002-VaidyaC #mining #privacy: Privacy preserving association rule mining in vertically partitioned data (JV, CC), pp. 639–644.
KDD-2002-VlachosDGKK #classification #reduction #visualisation: Non-linear dimensionality reduction techniques for classification and visualization (MV, CD, DG, GK, NK), pp. 645–651.
KDD-2002-WangS #ranking: Item selection by “hub-authority” profit ranking (KW, MYTS), pp. 652–657.
KDD-2002-CurcinGGKRSW #grid #information management #towards: Discovery net: towards a grid of knowledge discovery (VC, MG, YG, MK, AR, JS, PW), pp. 658–663.
KDD-2002-WuF #performance #scalability: Making every bit count: fast nonlinear axis scaling (LW, CF), pp. 664–669.
KDD-2002-WuFS #approach #classification #data mining #mining #named: B-EM: a classifier incorporating bootstrap with EM approach for data mining (XW, JF, KRS), pp. 670–675.
KDD-2002-YamanishiT #detection #framework: A unifying framework for detecting outliers and change points from non-stationary time series data (KY, JiT), pp. 676–681.
KDD-2002-YangGY #algorithm #clustering #effectiveness #named #performance #transaction: CLOPE: a fast and effective clustering algorithm for transactional data (YY, XG, JY), pp. 682–687.
KDD-2002-YangZCJ #detection #topic: Topic-conditioned novelty detection (YY, JZ, JGC, CJ), pp. 688–693.
KDD-2002-ZadroznyE #classification #multi #probability: Transforming classifier scores into accurate multiclass probability estimates (BZ, CE), pp. 694–699.

Proceedings of the Eighth International Conference on Knowledge Discovery and Data MiningKDD, 2002.

Contents (88 items)

Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining
KDD, 2002.