Knowledge Discovery in Databases: PKDD 2007
Home > Computing and Information Technology > Databases > Knowledge Discovery in Databases: PKDD 2007: 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings
Knowledge Discovery in Databases: PKDD 2007: 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings

Knowledge Discovery in Databases: PKDD 2007: 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

The two premier annual European conferences in the areas of machine learning and data mining have been collocated ever since the ?rst joint conference in Freiburg, 2001. The European Conference on Machine Learning (ECML) traces its origins to 1986, when the ?rst European Working Session on Learning was held in Orsay, France. The European Conference on Principles and Practice of KnowledgeDiscoveryinDatabases(PKDD) was?rstheldin1997inTrondheim, Norway. Over the years, the ECML/PKDD series has evolved into one of the largest and most selective international conferences in machine learning and data mining. In 2007, the seventh collocated ECML/PKDD took place during September 17–21 on the centralcampus of WarsawUniversityand in the nearby Staszic Palace of the Polish Academy of Sciences. The conference for the third time used a hierarchical reviewing process. We nominated 30 Area Chairs, each of them responsible for one sub-?eld or several closely related research topics. Suitable areas were selected on the basis of the submission statistics for ECML/PKDD 2006 and for last year’s International Conference on Machine Learning (ICML 2006) to ensure a proper load balance amongtheAreaChairs.AjointProgramCommittee(PC)wasnominatedforthe two conferences, consisting of some 300 renowned researchers, mostly proposed by the Area Chairs. This joint PC, the largest of the series to date, allowed us to exploit synergies and deal competently with topic overlaps between ECML and PKDD. ECML/PKDD 2007 received 592 abstract submissions. As in previous years, toassistthereviewersandtheAreaChairsintheir?nalrecommendationauthors had the opportunity to communicate their feedback after the reviewing phase.

Table of Contents:
Invited Talks.- Learning, Information Extraction and the Web.- Putting Things in Order: On the Fundamental Role of Ranking in Classification and Probability Estimation.- Mining Queries.- Adventures in Personalized Information Access.- Long Papers.- Experiment Databases: Towards an Improved Experimental Methodology in Machine Learning.- Using the Web to Reduce Data Sparseness in Pattern-Based Information Extraction.- A Graphical Model for Content Based Image Suggestion and Feature Selection.- Efficient AUC Optimization for Classification.- Finding Transport Proteins in a General Protein Database.- Classification of Web Documents Using a Graph-Based Model and Structural Patterns.- Context-Specific Independence Mixture Modelling for Protein Families.- An Algorithm to Find Overlapping Community Structure in Networks.- Privacy Preserving Market Basket Data Analysis.- Feature Extraction from Sensor Data Streams for Real-Time Human Behaviour Recognition.- Generating Social Network Features for Link-Based Classification.- An Empirical Comparison of Exact Nearest Neighbour Algorithms.- Site-Independent Template-Block Detection.- Statistical Model for Rough Set Approach to Multicriteria Classification.- Classification of Anti-learnable Biological and Synthetic Data.- Improved Algorithms for Univariate Discretization of Continuous Features.- Efficient Weight Learning for Markov Logic Networks.- Classification in Very High Dimensional Problems with Handfuls of Examples.- Domain Adaptation of Conditional Probability Models Via Feature Subsetting.- Learning to Detect Adverse Traffic Events from Noisily Labeled Data.- IKNN: Informative K-Nearest Neighbor Pattern Classification.- Finding Outlying Items in Sets of Partial Rankings.- Speeding Up Feature Subset Selection Through Mutual Information Relevance Filtering.- A Comparison of Two Approaches to Classify with Guaranteed Performance.- Towards Data Mining Without Information on Knowledge Structure.- Relaxation Labeling for Selecting and Exploiting Efficiently Non-local Dependencies in Sequence Labeling.- Bridged Refinement for Transfer Learning.- A Prediction-Based Visual Approach for Cluster Exploration and Cluster Validation by HOV3.- Short Papers.- Flexible Grid-Based Clustering.- Polyp Detection in Endoscopic Video Using SVMs.- A Density-Biased Sampling Technique to Improve Cluster Representativeness.- Expectation Propagation for Rating Players in Sports Competitions.- Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract).- Discovering Emerging Patterns in Spatial Databases: A Multi-relational Approach.- Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases.- Learning Multi-dimensional Functions: Gas Turbine Engine Modeling.- Constructing High Dimensional Feature Space for Time Series Classification.- A Dynamic Clustering Algorithm for Mobile Objects.- A Method for Multi-relational Classification Using Single and Multi-feature Aggregation Functions.- MINI: Mining Informative Non-redundant Itemsets.- Stream-Based Electricity Load Forecast.- Automatic Hidden Web Database Classification.- Pruning Relations for Substructure Discovery of Multi-relational Databases.- The Most Reliable Subgraph Problem.- Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains.- Searching for Better Randomized Response Schemes for Privacy-Preserving Data Mining.- Pre-processing Large Spatial Data Sets with Bayesian Methods.- Tag Recommendations in Folksonomies.- Providing Naïve Bayesian Classifier-Based Private Recommendations on Partitioned Data.- Multi-party, Privacy-Preserving Distributed Data Mining Using a Game Theoretic Framework.- Multilevel Conditional Fuzzy C-Means Clustering of XML Documents.- Uncovering Fraud in Direct Marketing Data with a Fraud Auditing Case Builder.- Real Time GPU-Based Fuzzy ART Skin Recognition.- A Cooperative Game Theoretic Approach to Prototype Selection.- Dynamic BayesianNetworks for Real-Time Classification of Seismic Signals.- Robust Visual Mining of Data with Error Information.- An Effective Approach to Enhance Centroid Classifier for Text Categorization.- Automatic Categorization of Human-Coded and Evolved CoreWar Warriors.- Utility-Based Regression.- Multi-label Lazy Associative Classification.- Visual Exploration of Genomic Data.- Association Mining in Large Databases: A Re-examination of Its Measures.- Semantic Text Classification of Emergent Disease Reports.


Best Sellers


Product Details
  • ISBN-13: 9783540749752
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 644
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3540749756
  • Publisher Date: 31 Aug 2007
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Knowledge Discovery in Databases: PKDD 2007: 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Knowledge Discovery in Databases: PKDD 2007: 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Knowledge Discovery in Databases: PKDD 2007: 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!