Proceedings of the Third International Conference on Knowledge Discovery and Data Mining
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

David Heckerman, Heikki Mannila, Daryl Pregibon
Proceedings of the Third International Conference on Knowledge Discovery and Data Mining
KDD, 1997.

KER
DBLP
Scholar
?EE?
Full names Links ISxN
@proceedings{KDD-1997,
	address       = "Newport Beach, California, USA",
	editor        = "David Heckerman and Heikki Mannila and Daryl Pregibon",
	ee            = "http://www.aaai.org/Library/KDD/kdd97contents.php",
	isbn          = "1-57735-027-8",
	publisher     = "{AAAI Press}",
	title         = "{Proceedings of the Third International Conference on Knowledge Discovery and Data Mining}",
	year          = 1997,
}

Contents (65 items)

KDD-1997-DerthickKR #data analysis #interactive #visualisation
An Interactive Visualization Environment for Data Exploration (MD, JK, SFR), pp. 2–9.
KDD-1997-EsterKSX #database #detection #set
Density-Connected Sets and their Application for Trend Detection in Spatial Databases (ME, HPK, JS, XX), pp. 10–15.
KDD-1997-FeldmanKZ #data mining #documentation #mining #visualisation
Visualization Techniques to Explore Data Mining Results for Document Collections (RF, WK, AZ), pp. 16–23.
KDD-1997-KeoghS #approach #database #pattern matching #performance #probability
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases (EJK, PS), pp. 24–30.
KDD-1997-LiuHC #classification #using
Using General Impressions to Analyze Discovered Classification Rules (BL, WH, SC), pp. 31–36.
KDD-1997-NakhaeizadehS #algorithm #data mining #development #evaluation #metric #mining #multi
Development of Multi-Criteria Metrics for Evaluation of Data Mining Algorithms (GN, AS), pp. 37–42.
KDD-1997-ProvostF #analysis #classification #comparison #performance #visualisation
Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Distributions (FJP, TF), pp. 43–48.
KDD-1997-RubinsteinH #learning
Discriminative vs Informative Learning (YDR, TH), pp. 49–53.
KDD-1997-SmythW #data analysis #set
Anytime Exploratory Data Analysis for Massive Data Sets (PS, DW), pp. 54–60.
KDD-1997-SmythGIRF #clustering #detection #using
Detecting Atmospheric Regimes Using Cross-Validated Clustering (PS, MG, KI, JR, AF), pp. 61–66.
KDD-1997-SrikantVA #constraints #mining
Mining Association Rules with Item Constraints (RS, QV, RA), pp. 67–73.
KDD-1997-StolfoPTLFC #database #distributed #java #named
JAM: Java Agents for Meta-Learning over Distributed Databases (SJS, ALP, ST, WL, DWF, PKC), pp. 74–81.
KDD-1997-SubramonianVC #framework #interactive #visual notation
A Visual Interactive Framework for Attribute Discretization (RS, RV, JC), pp. 82–88.
KDD-1997-WangWSSDRZ #3d #automation
Automated Discovery of Active Motifs in Three Dimensional Molecules (XW, JTLW, DS, BAS, SD, IR, KZ), pp. 89–95.
KDD-1997-YodaFMMT
Computing Optimized Rectilinear Regions for Association Rules (KY, TF, YM, SM, TT), pp. 96–103.
KDD-1997-Zytkow #concept #equation
Knowledge = Concepts: A Harmful Equation (JMZ), pp. 104–109.
KDD-1997-AdomaviciusT #approach #database
Discovery of Actionable Patterns in Databases: The Action Hierarchy Approach (GA, AT), pp. 111–114.
KDD-1997-AliMS #classification #using
Partial Classification Using Association Rules (KA, SM, RS), pp. 115–118.
KDD-1997-AronisP #algorithm #data mining #mining #performance
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation (JMA, FJP), pp. 119–122.
KDD-1997-Bayardo #classification #mining
Brute-Force Mining of High-Confidence Classification Rules (RJBJ), pp. 123–126.
KDD-1997-BergstenSS #analysis #data mining #machine learning #mining
Applying Data Mining and Machine Learning Techniques to Submarine Intelligence Analysis (UB, JS, PS), pp. 127–130.
KDD-1997-BreitnerSW #database
Process-Based Database Support for the Early Indicator Method (CB, JS, RW), pp. 131–134.
KDD-1997-BrunkKK #data mining #mining #named
MineSet: An Integrated System for Data Mining (CB, JK, RK), pp. 135–138.
KDD-1997-CerquidesM #comparison #empirical
Proposal and Empirical Comparison of a Parallelizable Distance-Based Discretization Method (JC, RLdM), pp. 139–142.
KDD-1997-ChattratichatDGGHKSTY #challenge #data mining #mining #scalability
Large Scale Data Mining: Challenges and Responses (JC, JD, MG, YG, HH, MK, JS, HWT, DY), pp. 143–146.
KDD-1997-ChienFMLG #data analysis #database #image #scalability #using
Using Artificial Intelligence Planning to Automate Science Data Analysis for Large Image Databases (SAC, FF, HM, EL, RG), pp. 147–150.
KDD-1997-DeCoste #behaviour #mining #multi
Mining Multivariate Time-Series Sensor Data to Discover Behavior Envelopes (DD), pp. 151–154.
KDD-1997-Domingos #why
Why Does Bagging Work? A Bayesian Account and its Implications (PMD), pp. 155–158.
KDD-1997-Drucker #classification #performance
Fast Committee Machines for Regression and Classification (HD), pp. 159–162.
KDD-1997-EngelsLS #data mining #mining
A Guided Tour through the Data Mining Jungle (RE, GL, RS), pp. 163–166.
KDD-1997-FeldmanAAZK #documentation #keyword #mining
Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections (RF, YA, AA, AZ, WK), pp. 167–170.
KDD-1997-GalalCH #parallel #scalability
Improving Scalability in a Scientific Discovery System by Exploiting Parallelism (GG, DJC, LBH), pp. 171–174.
KDD-1997-HahnS #information management #natural language
Deep Knowledge Discovery from Natural Language Texts (UH, KS), pp. 175–178.
KDD-1997-HaimowitzGS #database #distributed #mining
Integrating and Mining Distributed Customer Databases (IJH, ÖGA, HS), pp. 179–182.
KDD-1997-Hekanaho #concept #learning
GA-Based Rule Enhancement in Concept Learning (JH), pp. 183–186.
KDD-1997-HinkeRRG #independence #mining #roadmap
Target-Independent Mining for Scientific Data: Capturing Transients and Trends for Phenomena Mining (THH, JAR, HSR, SJG), pp. 187–190.
KDD-1997-HoS #named
Zeta: A Global Method for Discretization of Continuous Variables (KMH, PDS), pp. 191–194.
KDD-1997-JensenS #multi
Adjusting for Multiple Comparisons in Decision Tree Pruning (DJ, MDS), pp. 195–198.
KDD-1997-JohnL
SIPping from the Data Firehose (GHJ, BL), pp. 199–202.
KDD-1997-KahngM #algorithm #mining
Mining Generalized Term Associations: Count Propagation Algorithm (JK, WHKL, DM), pp. 203–206.
KDD-1997-KamberHC #mining #multi #using
Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes (MK, JH, JC), pp. 207–210.
KDD-1997-KarguptaHS #architecture #data mining #distributed #mining #scalability
Scalable, Distributed Data Mining — An Agent Architecture (HK, IH, BS), pp. 211–214.
KDD-1997-Ketterlin #clustering #sequence
Clustering Sequences of Complex Objects (AK), pp. 215–218.
KDD-1997-KnorrN
A Unified Notion of Outliers: Properties and Computation (EMK, RTN), pp. 219–222.
KDD-1997-KramerPH #machine learning #mining
Mining for Causes of Cancer: Machine Learning Experiments at Various Levels of Detail (SK, BP, CH), pp. 223–226.
KDD-1997-LentAS #database #roadmap
Discovering Trends in Text Databases (BL, RA, RS), pp. 227–230.
KDD-1997-MihalisinT #data mining #mining #performance #robust #visual notation
Fast Robust Visual Data Mining (TM, JT), pp. 231–234.
KDD-1997-PazzaniMS #learning
Beyond Concise and Colorful: Learning Intelligible Rules (MJP, SM, WRS), pp. 235–238.
KDD-1997-ProvostK #algorithm #induction #overview #perspective #scalability
Scaling Up Inductive Algorithms: An Overview (FJP, VK), pp. 239–242.
KDD-1997-RaoP #visualisation
Visualizing Bagged Decision Trees (JSR, WJEP), pp. 243–246.
KDD-1997-SiebesK #database #interactive #named
KESO: Minimizing Database Interaction (AS, MLK), pp. 247–250.
KDD-1997-Soderland #learning #web
Learning to Extract Text-Based Information from the World Wide Web (SS), pp. 251–254.
KDD-1997-StoughB #image #multi #reduction
Image Feature Reduction through Spoiling: Its Application to Multiple Matched Filters for Focus of Attention (TMS, CEB), pp. 255–258.
KDD-1997-Suzuki #exception #reliability
Autonomous Discovery of Reliable Exception Rules (ES), pp. 259–262.
KDD-1997-ThomasBAR #algorithm #database #incremental #performance #scalability
An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases (ST, SB, KA, SR), pp. 263–266.
KDD-1997-TurmonMP #identification
Bayesian Inference for Identifying Solar Active Regions (MJT, SM, JP), pp. 267–270.
KDD-1997-WangL #semistructured data
Schema Discovery for Semistructured Data (KW, HL), pp. 271–274.
KDD-1997-WangS
Selecting Features by Vertical Compactness of Data (KW, SS), pp. 275–278.
KDD-1997-Xia #effectiveness #framework #information management
Knowledge Discovery in Integrated Call Centers: A Framework for Effective Customer-Driven Marketing (PX), pp. 279–282.
KDD-1997-ZakiPOL #algorithm #performance
New Algorithms for Fast Discovery of Association Rules (MJZ, SP, MO, WL), pp. 283–286.
KDD-1997-ZamirEMK #clustering #documentation #performance #web
Fast and Intuitive Clustering of Web Documents (OZ, OE, OM, RMK), pp. 287–290.
KDD-1997-ZhongLKO #process
KDD Process Planning (NZ, CL, YK, SO), pp. 291–294.
KDD-1997-ZighedRF #learning #multi
Optimal Multiple Intervals Discretization of Continuous Attributes for Supervised Learning (DAZ, RR, FF), pp. 295–298.
KDD-1997-ZupanBBC #approach #composition #data mining #dataset #mining
A Dataset Decomposition Approach to Data Mining and Machine Discovery (BZ, MB, IB, BC), pp. 299–302.
KDD-1997-Huber #scalability #statistics
From Large to Huge: A Statistician’s Reactions to KDD & DM (PJH), pp. 304–308.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.