The SCEAS System
Navigation Menu

Conferences in DBLP

Knowledge Discovery and Data Mining (KDD) (kdd)
2002 (conf/kdd/2002)

  1. Greg Ridgeway, David Madigan
    Bayesian analysis of massive datasets via particle filters. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:5-13 [Conf]
  2. Fatemah A. Alqallaf, Kjell P. Konis, R. Douglas Martin, Ruben H. Zamar
    Scalable robust covariance and correlation estimates for data mining. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:14-23 [Conf]
  3. Kristin P. Bennett, Michinari Momma, Mark J. Embrechts
    MARK: a boosting algorithm for heterogeneous kernel models. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:24-31 [Conf]
  4. Pang-Ning Tan, Vipin Kumar, Jaideep Srivastava
    Selecting the right interestingness measure for association patterns. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:32-41 [Conf]
  5. Cristian Bucila, Johannes Gehrke, Daniel Kifer, Walker M. White
    DualMiner: a dual-pruning algorithm for itemsets with constraints. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:42-51 [Conf]
  6. Alexander Tuzhilin, Bing Liu
    Querying multiple sets of discovered rules. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:52-60 [Conf]
  7. Matt Richardson, Pedro Domingos
    Mining knowledge-sharing sites for viral marketing. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:61-70 [Conf]
  8. Mohammed Javeed Zaki
    Efficiently mining frequent trees in a forest. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:71-80 [Conf]
  9. Christopher R. Palmer, Phillip B. Gibbons, Christos Faloutsos
    ANF: a fast and scalable tool for data mining in massive graphs. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:81-90 [Conf]
  10. Jon M. Kleinberg
    Bursty and hierarchical structure in streams. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:91-101 [Conf]
  11. Eamonn J. Keogh, Shruti Kasetty
    On the need for time series data mining benchmarks: a survey and empirical demonstration. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:102-111 [Conf]
  12. Chris Stolte, Diane Tang, Pat Hanrahan
    Query, analysis, and visualization of hierarchically structured data using Polaris. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:112-122 [Conf]
  13. Jörg A. Walter, Helge Ritter
    On interactive visualization of high-dimensional data using the hyperbolic plane. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:123-132 [Conf]
  14. Thorsten Joachims
    Optimizing search engines using clickthrough data. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:133-142 [Conf]
  15. Corin R. Anderson, Pedro Domingos, Daniel S. Weld
    Relational Markov models and their application to adaptive web navigation. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:143-152 [Conf]
  16. Darya Chudova, Padhraic Smyth
    Pattern discovery in sequences under a Markov assumption. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:153-162 [Conf]
  17. Charu C. Aggarwal
    On effective classification of strings with wavelets. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:163-172 [Conf]
  18. Deepak K. Agarwal
    Shrinkage estimator generalizations of Proximal Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:173-182 [Conf]
  19. Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
    Hierarchical model-based clustering of large datasets through fractionation and refractionation. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:183-190 [Conf]
  20. Inderjit S. Dhillon, Subramanyam Mallela, Rahul Kumar
    Enhanced word clustering for hierarchical text classification. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:191-200 [Conf]
  21. Canasai Kruengkrai, Chuleerat Jaruskulchai
    A parallel learning algorithm for text classification. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:201-206 [Conf]
  22. Haoran Wu, Tong-Heng Phang, Bing Liu, Xiaoli Li
    A refinement approach to handling model misfit in text categorization. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:207-216 [Conf]
  23. Alexandre V. Evfimievski, Ramakrishnan Srikant, Rakesh Agrawal, Johannes Gehrke
    Privacy preserving mining of association rules. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:217-228 [Conf]
  24. Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
    Mining frequent item sets by opportunistic projection. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:229-238 [Conf]
  25. Hwanjo Yu, Jiawei Han, Kevin Chen-Chuan Chang
    PEBL: positive example based learning for Web page classification using SVM. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:239-248 [Conf]
  26. Martin Ester, Hans-Peter Kriegel, Matthias Schubert
    Web site mining: a new way to spot competitors, customers and suppliers in the world wide web. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:249-258 [Conf]
  27. Edwin P. D. Pednault, Naoki Abe, Bianca Zadrozny
    Sequential cost-sensitive decision making with reinforcement learning. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:259-268 [Conf]
  28. Sunita Sarawagi, Anuradha Bhamidipaty
    Interactive deduplication using active learning. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:269-278 [Conf]
  29. Vijay S. Iyengar
    Transforming data to satisfy privacy constraints. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:279-288 [Conf]
  30. Kristin P. Bennett, Ayhan Demiriz, Richard Maclin
    Exploiting unlabeled data in ensemble methods. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:289-296 [Conf]
  31. Mahesh V. Joshi, Ramesh C. Agarwal, Vipin Kumar
    Predicting rare classes: can boosting make any weak learner strong? [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:297-306 [Conf]
  32. Aleksander Kolcz, Xiaomei Sun, Jugal Kalitax
    Efficient handling of high-dimensional feature spaces by randomized classifier ensembles. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:307-313 [Conf]
  33. Mohammad El-Ramly, Eleni Stroulia, Paul G. Sorenson
    From run-time behavior to usage scenarios: an interaction-pattern mining approach. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:315-324 [Conf]
  34. Andrew Storey, Marc-David Cohen
    Exploiting response models: optimizing cross-sell and up-sell opportunities in banking. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:325-331 [Conf]
  35. Saharon Rosset, Einat Neumann, Uri Eick, Nurit Vatnik, Yizhak Idan
    Customer lifetime value modeling and its use for customer retention planning. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:332-340 [Conf]
  36. Satoshi Morinaga, Kenji Yamanishi, Kenji Tateishi, Toshikazu Fukushima
    Mining product reputations on the Web. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:341-349 [Conf]
  37. Sheila Tejada, Craig A. Knoblock, Steven Minton
    Learning domain-independent string transformation weights for high accuracy object identification. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:350-359 [Conf]
  38. Sholom M. Weiss, Naval K. Verma
    A system for real-time competitive market intelligence. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:360-365 [Conf]
  39. Klaus Julisch, Marc Dacier
    Mining intrusion detection alarms for actionable knowledge. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:366-375 [Conf]
  40. Matthew V. Mahoney, Philip K. Chan
    Learning nonstationary models of normal network traffic for detecting novel attacks. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:376-385 [Conf]
  41. Karlton Sequeira, Mohammed Javeed Zaki
    ADMIT: anomaly-based data mining for intrusions. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:386-395 [Conf]
  42. Alexander Tuzhilin, Gediminas Adomavicius
    Handling very large numbers of association rules in the analysis of microarray data. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:396-404 [Conf]
  43. Peter Antal, Patrick Glenisson, Geert Fannes
    On the potential of domain literature for clustering and Bayesian network learning. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:405-414 [Conf]
  44. Yulan Liang, Arpad Kelemen
    Mining heterogeneous gene expression data with time lagged recurrent neural networks. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:415-421 [Conf]
  45. Charu C. Aggarwal
    Collaborative crawling: mining user experiences for topical resource discovery. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:423-428 [Conf]
  46. Jay Ayres, Jason Flannick, Johannes Gehrke, Tomi Yiu
    Sequential PAttern mining using a bitmap representation. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:429-435 [Conf]
  47. Florian Beil, Martin Ester, Xiaowei Xu
    Frequent term-based text clustering. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:436-442 [Conf]
  48. Shai Ben-David, Johannes Gehrke, Reba Schuller
    A theoretical framework for learning from a pool of disparate data sources. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:443-449 [Conf]
  49. Ella Bingham, Heikki Mannila, Jouni K. Seppänen
    Topics in 0--1 data. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:450-455 [Conf]
  50. Olcay Boz
    Extracting decision trees from trained neural networks. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:456-461 [Conf]
  51. Bin Chen, Peter J. Haas, Peter Scheuermann
    A new two-phase sampling based algorithm for discovering association rules. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:462-468 [Conf]
  52. Christina Yip Chung, Bin Chen
    CVS: a Correlation-Verification based Smoothing technique on information retrieval and term clustering. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:469-474 [Conf]
  53. William W. Cohen, Jacob Richman
    Learning to match and cluster large high-dimensional data sets for data integration. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:475-480 [Conf]
  54. Alin Dobra, Johannes Gehrke
    SECRET: a scalable linear regression tree algorithm. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:481-487 [Conf]
  55. Tina Eliassi-Rad, Terence Critchlow, Ghaleb Abdulla
    Tina Eliassi-Rad, Terence Critchlow, Ghaleb Abdulla. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:488-494 [Conf]
  56. Bin Fang, Wynne Hsu, Mong-Li Lee
    Tumor cell identification using features rules. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:495-500 [Conf]
  57. Dimitris Fragoudis, Dimitris Meretakis, Spiros Likothanassis
    Integrating feature and instance selection for text classification. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:501-506 [Conf]
  58. Hichem Frigui
    SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:507-512 [Conf]
  59. Shantanu Godbole, Sunita Sarawagi, Soumen Chakrabarti
    Scaling multi-class support vector machines using inter-class confusion. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:513-518 [Conf]
  60. Tu Bao Ho, Trong Dung Nguyen, DucDung Nguyen
    Visualization support for a user-centered KDD process. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:519-524 [Conf]
  61. Geoff Hulten, Pedro Domingos
    Mining complex models from arbitrarily large databases in constant time. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:525-531 [Conf]
  62. Srinivasan Jagannathan, Jayanth Nayak, Kevin C. Almeroth, Markus Hofmann
    A model for discovering customer value for E-content. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:532-537 [Conf]
  63. Glen Jeh, Jennifer Widom
    SimRank: a measure of structural-context similarity. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:538-543 [Conf]
  64. Xiaoming Jin, Yuchang Lu, Chunyi Shi
    Similarity measure based on partial information of time series. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:544-549 [Conf]
  65. Eamonn J. Keogh, Stefano Lonardi, Bill Yuan-chi Chiu
    Finding surprising patterns in a time series database in linear time and space. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:550-556 [Conf]
  66. Mahesh Kumar, Nitin R. Patel, Jonathan Woo
    Clustering seasonality patterns in the presence of errors. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:557-563 [Conf]
  67. Jiuyong Li, Rodney W. Topor, Hong Shen
    Construct robust rule sets for classification. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:564-569 [Conf]
  68. Ruey-Hsia Li, Geneva G. Belford
    Instability of decision tree classification algorithms. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:570-575 [Conf]
  69. Cheng-Ru Lin, Chang-Hung Lee, Ming-Syan Chen, Philip S. Yu
    Distributed data mining in a chain store database of short transactions. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:576-581 [Conf]
  70. Cheng-Ru Lin, Ming-Syan Chen
    A robust and efficient clustering algorithm based on cohesion self-merging. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:582-587 [Conf]
  71. Shian-Hua Lin, Jan-Ming Ho
    Discovering informative content blocks from Web documents. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:588-593 [Conf]
  72. Bertis B. Little, Walter L. Johnston, Ashley C. Lovell, Roderick M. Rejesus, Steve A. Steed
    Collusion in the U.S. crop insurance program: applied data mining. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:594-598 [Conf]
  73. Rey-Long Liu, Yun-Ling Lu
    Incremental context mining for adaptive document classification. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:599-604 [Conf]
  74. Anna Olecka
    Evaluating classifiers' performance in a constrained environment. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:605-612 [Conf]
  75. Patrick Pantel, Dekang Lin
    Discovering word senses from text. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:613-619 [Conf]
  76. Bhavani Raskutti, Herman L. Ferrá, Adam Kowalczyk
    Combining clustering and co-training to enhance text classification using unlabelled data. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:620-625 [Conf]
  77. Naonori Ueda, Kazumi Saito
    Single-shot detection of multiple categories of text using parametric mixture models. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:626-631 [Conf]
  78. Secil Ugurel, Robert Krovetz, C. Lee Giles
    What's the code?: automatic classification of source code archives. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:639-644 [Conf]
  79. Jaideep Vaidya, Chris Clifton
    Privacy preserving association rule mining in vertically partitioned data. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:639-644 [Conf]
  80. Michail Vlachos, Carlotta Domeniconi, Dimitrios Gunopulos, George Kollios, Nick Koudas
    Non-linear dimensionality reduction techniques for classification and visualization. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:645-651 [Conf]
  81. Ke Wang, Ming-Yen Thomas Su
    Item selection by "hub-authority" profit ranking. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:652-657 [Conf]
  82. Vasa Curcin, Moustafa Ghanem, Yike Guo, Martin Köhler, Anthony Rowe, Jameel Syed, Patrick Wendel
    Discovery net: towards a grid of knowledge discovery. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:658-663 [Conf]
  83. Leejay Wu, Christos Faloutsos
    Making every bit count: fast nonlinear axis scaling. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:664-669 [Conf]
  84. Xintao Wu, Jianping Fan, Kalpathi R. Subramanian
    B-EM: a classifier incorporating bootstrap with EM approach for data mining. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:670-675 [Conf]
  85. Kenji Yamanishi, Jun-ichi Takeuchi
    A unifying framework for detecting outliers and change points from non-stationary time series data. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:676-681 [Conf]
  86. Yiling Yang, Xudong Guan, Jinyuan You
    CLOPE: a fast and effective clustering algorithm for transactional data. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:682-687 [Conf]
  87. Yiming Yang, Jian Zhang, Jaime G. Carbonell, Chun Jin
    Topic-conditioned novelty detection. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:688-693 [Conf]
  88. Bianca Zadrozny, Charles Elkan
    Transforming classifier scores into accurate multiclass probability estimates. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:694-699 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002