Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar1st ICDM 2001: San Jose, California, USA
Nick Cercone, Tsau Young Lin, Xindong Wu:
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November - 2 December 2001, San Jose, California, USA. IEEE Computer Society 2001, ISBN 0-7695-1119-8
Regular Papers
- Charu C. Aggarwal, Philip S. Yu:
On Effective Conceptual Indexing and Similarity Search in Text Data. 3-10 - Aijun An, Yuanyuan Wang:
Comparisons of Classification Methods for Screening Potential Compounds. 11-18 - Suhail Ansari, Ron Kohavi, Llew Mason, Zijian Zheng:
Integrating E-Commerce and Data Mining: Architecture and Challenges. 27-34 - José L. Balcázar, Yang Dai, Osamu Watanabe:
Provably Fast Training Algorithms for Support Vector Machines. 43-50 - Krishna Bharat, Bay-Wei Chang, Monika Rauch Henzinger, Matthias Ruhl:
Who Links to Whom: Mining Linkage between Web Sites. 51-58 - Catherine Blake, Wanda Pratt:
Better Rules, Few Features: A Semantic Approach to Selecting Features from Text. 59-66 - Rong Chen, Krishnamoorthy Sivakumar, Hillol Kargupta:
Distributed Web Mining Using Bayesian Networks from Multiple Data Streams. 75-82 - Jong-Sheng Cherng, Mei-Jung Lo:
A Hypergraph Based Clustering Algorithm for Spatial Data Sets. 83-90 - David Maxwell Chickering, Christopher Meek, Robert Rounthwaite:
Efficient Determination of Dynamic Split Points in a Decision Tree. 91-98 - Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Ming Gu, Horst D. Simon:
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. 107-114 - Tapio Elomaa, Juho Rousu:
Preprocessing Opportunities in Optimal Numerical Range Partitioning. 115-122 - Wei Fan, Matthew Miller, Salvatore J. Stolfo, Wenke Lee, Philip K. Chan:
Using Artificial Anomalies to Detect Unknown and Known Network Intrusions. 123-130 - Hichem Frigui, Mohamed Ben Hadj Rhouma:
A Synchronization Based Algorithm for Discovering Ellipsoidal Clusters in Large Datasets. 139-146 - Floris Geerts, Bart Goethals, Jan Van den Bussche:
A Tight Upper Bound on the Number of Candidate Patterns. 155-162 - Henner Graubitz, Myra Spiliopoulou, Karsten Winkler:
The DIAsDEM Framework for Converting Domain-Specific Texts into XML Documents with Data Mining Techniques. 171-178 - Maria Halkidi, Michalis Vazirgiannis:
Clustering Validity Assessment: Finding the Optimal Partitioning of a Data Set. 187-194 - Xiaofeng He, Chris H. Q. Ding, Hongyuan Zha, Horst D. Simon:
Automatic Topic Identification Using Webpage Clustering. 195-202 - Johan Himberg, Kalle Korpiaho, Heikki Mannila, Johanna Tikanmäki, Hannu Toivonen:
Time Series Segmentation for Context Recognition in Mobile Devices. 203-210 - Shoji Hirano, Shusaku Tsumoto:
Indiscernibility Degree of Objects for Evaluating Simplicity of Knowledge in the Clustering Procedure. 211-217 - Tzung-Pei Hong, Yeong-Chyi Lee:
Mining Coverage-Based Fuzzy Rules by Evolutional Computation. 218-224 - Xiaohua Hu:
Using Rough Sets Theory and Database Operations to Construct a Good Ensemble of Classifiers for Data Mining Applications. 233-240 - Hisao Ishibuchi, Takashi Yamamoto, Tomoharu Nakashima:
Fuzzy Data Mining: Effect of Fuzzy Discretization. 241-248 - Mahesh V. Joshi, Vipin Kumar, Ramesh C. Agarwal:
Evaluating Boosting Algorithms to Classify Rare Classes: Comparison and Improvements. 257-264 - Sung Young Jung, Taek-Soo Kim:
An Agglomerative Hierarchical Clustering Using Partial Maximum Array and Incremental Similarity Computation Method. 265-272 - Konstantinos Kalpakis, Dhiral Gada, Vasundhara Puttagunta:
Distance Measures for Effective Clustering of ARIMA Time-Series. 273-280 - Hillol Kargupta, Byung-Hoon Park:
Mining Decision Trees from Data Streams in a Mobile Environment. 281-288 - Eamonn J. Keogh, Selina Chu, David M. Hart, Michael J. Pazzani:
An Online Algorithm for Segmenting Time Series. 289-296 - Marzena Kryszkiewicz:
Concise Representation of Frequent Patterns Based on Disjunction-Free Generators. 305-312 - Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen:
On Mining General Temporal Association Rules in a Publication Database. 337-344 - Beitao Li, Wei-Cheng Lai, Edward Y. Chang, Kwang-Ting Cheng:
Mining Image Features for Efficient Query Processing. 353-360 - Jiuyong Li, Hong Shen, Rodney W. Topor:
Mining the Smallest Association Rule Set for Predictions. 361-368 - Wenmin Li, Jiawei Han, Jian Pei:
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules. 369-376 - Bing Liu, Yiming Ma, Ronnie Lee:
Analyzing the Interestingness of Association Rules from the Temporal Dimension. 377-384 - Gary Livingston, John M. Rosenberg, Bruce G. Buchanan:
Closing the Loop: An Agenda- and Justification-Based Framework for Selecting the Next Discovery Task to Perform. 385-392 - Gary Livingston, John M. Rosenberg, Bruce G. Buchanan:
Closing the Loop: Heuristics for Autonomous Discovery. 393-400 - Wen-Hsiang Lu, Lee-Feng Chien, Hsi-Jian Lee:
Anchor Text Mining for Translation of Web Queries. 401-408 - Paul Munteanu, Mohamed Bendou:
The EQ Framework for Learning Equivalence Classes of Bayesian Networks. 417-424 - Steven Noel, Vijay V. Raghavan, Chee-Hung Henry Chu:
Visualizing Association Mining Results through Hierarchical Clusters. 425-432 - Carlos Ordonez, Edward Omiecinski, Levien de Braal, Cesar A. Santana, Norberto F. Ezquerra, José A. Taboada, C. David Cooke, Elizabeth Krawczynska, Ernest V. Garcia:
Mining Constrained Association Rules to Predict Heart Disease. 433-440 - Jian Pei, Jiawei Han, Hongjun Lu, Shojiro Nishio, Shiwei Tang, Dongqing Yang:
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases. 441-448 - Chang-Shing Perng, Haixun Wang, Sheng Ma, Joseph L. Hellerstein:
FARM: A Framework for Exploring Mining Spaces with Multiple Attributes. 449-456 - Masakazu Seno, George Karypis:
LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing Support Constraint. 505-512 - Joaquim Ferreira da Silva, João Mexia, Carlos Agra Coelho, José Gabriel Pereira Lopes:
Document Clustering and Cluster Topic Extraction in Multilingual Corpora. 513-520 - François Velin, Pascale Kuntz, Henri Briand:
Web Cartography for Online State Promotion: An Algorithm for Clustering Web Resources. 529-535 - Ching-Yao Wang, Tzung-Pei Hong, Shian-Shyong Tseng:
Maintenance of Sequential Patterns for Record Deletion. 536-541 - Ning Zhong, Y. Y. Yao, Muneaki Ohshima, Setsuo Ohsuga:
Interestingness, Peculiarity, and Multi-Database Mining. 566-576
Posters
- Fernando Alonso, Juan Pedro Caraça-Valente, Loïc Martínez, César Montes:
Discovering Similar Patterns for Characterising Time Series in a Medical Domain. 577-579 - Jie Chen, Haiying Li, Shiwei Tang:
Association Rules Enhanced Classification of Underwater Acoustic Signal. 582-583 - June-Suh Cho, Nabil R. Adam:
Efficient Splitting Rules Based on the Probabilities of Pre-assigned Intervals. 584-585 - Honghua Dai, Xiaoshu Hang, Gang Li:
Inexact Field Learning: An Approach to Induce High Quality Rules from Low Quality Data. 586-588 - Wolfgang Gaul, Lars Schmidt-Thieme:
Mining Generalized Association Rules for Sequential and Path Data. 593-596 - Rayid Ghani:
Combining Labeled and Unlabeled Data for Text Classification with a Large Number of Categories. 597-598 - Sherri K. Harms, Jitender S. Deogun, Jamil Saquer, Tsegaye Tadesse:
Discovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed Episode Sets and Event Constraints. 603-606 - Andreas Hotho, Alexander Maedche, Steffen Staab:
Text Clustering Based on Good Aggregations. 607-608 - Viviane Crestana-Jensen, Nandit Soparkar:
Heuristic Optimization for Decentralized Frequent Itemset Counting. 613-614 - Gang Li, Fu Tong, Honghua Dai:
Evolutionary Structure Learning Algorithm for Bayesian Network and Penalized Mutual Information Metric. 615-616 - Manolis Maragoudakis, Katia Kermanidis, Nikos Fakotakis, George K. Kokkinakis:
Learning Automatic Acquisition of Subcategorization Frames Using Bayesian Inference and Support Vector Machines. 623-625 - Petri Myllymäki, Tomi Silander, Henry Tirri, Pekka Uronen:
Bayesian Data Mining on the Web with B-Course. 626-629 - Tadashi Nomoto, Yuji Matsumoto:
An Experimental Comparison of Supervised and Unsupervised Approaches to Text Summarization. 630-632 - Carlos Ordonez, Edward Omiecinski, Norberto F. Ezquerra:
A Fast Algorithm to Cluster High Dimensional Basket Data. 633-636 - Guillermo Sánchez-Díaz, José Ruiz-Shulcloper:
A Clustering Method for Very Large Mixed Data Sets. 643-644 - Tobias Scheffer, Christian Decomain, Stefan Wrobel:
Mining the Web with Active Hidden Markov Models. 645-646 - Sam Steingold, Richard Wherry, Gregory Piatetsky-Shapiro:
Measuring Real-Time Predictive Models. 649-650 - Fengzhan Tian, Hongwei Zhang, Yuchang Lu, Chunyi Shi:
Incremental Learning of Bayesian Networks with Hidden Variables. 651-652 - Fan-Chen Tseng, Ching-Chi Hsu, Henry Chen:
Mining Frequent Closed Itemsets with the Frequent Pattern List. 653-654 - Show-Jane Yen, Yue-Shi Lee:
An Efficient Data Mining Technique for Discovering Interesting Sequential Patterns. 663-664 - Osmar R. Zaïane, Mohammad El-Hajj, Paul Lu:
Fast Parallel Association Rule Mining without Candidacy Generation. 665-668 - Bernard Zenko, Ljupco Todorovski, Saso Dzeroski:
A Comparison of Stacking with Meta Decision Trees to Bagging, Boosting, and Stacking with other Methods. 669-670 - Qinghua Zou, Wesley W. Chu, David B. Johnson, Henry Chiu:
A Pattern Decomposition (PD) Algorithm for Finding All Frequent Patterns in Large Datasets. 673-674
last updated on 2019-05-23 00:19 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
