{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":29,"n_cols":5,"rows_kept":29,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466157203316"]
[null,null,"Titolo",null,"Knowledge Discovery in Databases: PKDD 2006 [[electronic resource] ] : 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18-22, 2006, Proceedings / / edited by Johannes Fürnkranz, Tobias Scheffer, Myra Spiliopoulou"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006"]
[null,null,"ISBN",null,"3-540-46048-9"]
[null,null,"Edizione",null,"[1st ed. 2006.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XXII, 660 p.)"]
[null,null,"Collana",null,"Lecture Notes in Artificial Intelligence ; ; 4213"]
[null,null,"Disciplina",null,"005.3/12"]
[null,null,"Soggetti",null,"Data structures (Computer science)"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Database management"]
[{"$nulls":4},"Information storage and retrieval"]
[{"$nulls":4},"Mathematical statistics"]
[{"$nulls":4},"Natural language processing (Computer science)"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Database Management"]
[{"$nulls":4},"Information Storage and Retrieval"]
[{"$nulls":4},"Probability and Statistics in Computer Science"]
[{"$nulls":4},"Natural Language Processing (NLP)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Talks -- On Temporal Evolution in Data Streams -- The Future of CiteSeer: CiteSeerx -- Learning to Have Fun -- Winning the DARPA Grand Challenge -- Challenges of Urban Sensing -- Long Papers -- SD-Map – A Fast Algorithm for Exhaustive Subgroup Discovery -- Decision Trees for Hierarchical Multilabel Classification: A Case Study in Functional Genomics -- Clustering Scientific Literature Using Sparse Citation Graph Analysis -- VOGUE: A Novel Variable Order-Gap State Machine for Modeling Sequences -- Don’t Be Afraid of Simpler Patterns -- An Adaptive Prequential Learning Framework for Bayesian Network Classifiers -- Adaptive Active Classification of Cell Assay Images -- "]
[{"$nulls":4},"Learning Parameters in Entity Relationship Graphs from Ranking Preferences -- Detecting Fraudulent Personalities in Networks of Online Auctioneers -- Measuring Constraint-Set Utility for Partitional Clustering Algorithms -- Discovery of Interesting Regions in Spatial Data Sets Using Supervised Clustering -- Optimal String Mining Under Frequency Constraints -- k-Anonymous Decision Tree Induction -- Closed Sets for Labeled Data -- Finding Trees from Unordered 0–1 Data -- Web Communities Identification from Random Walks -- Information Marginalization on Subgraphs -- Why Does Subsequence Time-Series Clustering Produce Sine Waves? -- Transductive Learning for Text Classification Using Explicit Knowledge Models -- Exploring Multiple Communities with Kernel-Based Link Analysis -- Distribution Rules with Numeric Attributes of Interest -- Tractable Models for Information Diffusion in Social Networks -- Efficient Spatial Classification Using Decoupled Conditional Random Fields -- Group SAX: Extending the Notion of Contrast Sets to Time Series and Multimedia Data -- An Attacker’s View of Distance Preserving Maps for Privacy Preserving Data Mining -- A Scalable Distributed Stream Mining System for Highway Traffic Data -- K-Landmarks: Distributed Dimensionality Reduction for Clustering Quality Maintenance -- The Discrete Basis Problem -- Evaluation of Summarization Schemes for Learning in Streams -- Efficient Mining of Correlation Patterns in Spatial Point Data -- Improving Functional Modularity in Protein-Protein Interactions Graphs Using Hub-Induced Subgraphs -- Refining Aggregate Conditions in Relational Learning -- Measuring to Fit: Virtual Tailoring Through Cluster Analysis and Classification -- RIVA: Indexing and Visualization of High-Dimensional Data Via Dimension Reorderings -- Distributed Subgroup Mining -- Network Flow for Collaborative Ranking -- Short Papers -- Finding Hierarchies of Subspace Clusters -- Integrating Pattern Mining in Relational Databases -- Discovering Patterns in Real-Valued Time Series -- Classification of Dementia Types from Cognitive Profiles Data -- When Efficient Model Averaging Out-Performs Boosting and Bagging -- Peak-Jumping Frequent Itemset Mining Algorithms -- Autonomous Visualization -- Naive Bayes for Text Classification with Unbalanced Classes -- Knowledge-Conscious Data Clustering -- On the Lower Bound of Reconstruction Error for Spectral Filtering Based Privacy Preserving Data Mining -- Frequent Pattern Discovery Without Binarization: Mining Attribute Profiles -- Efficient Name Disambiguation for Large-Scale Databases -- Adaptive Segmentation-Based Symbolic Representations of Time Series for Better Modeling and Lower Bounding Distance Measures -- A Feature Generation Algorithm for Sequences with Application to Splice-Site Prediction -- Discovering Image-Text Associations for Cross-Media Web Information Fusion -- Mining Sequences of Temporal Intervals -- Pattern Teams -- Compression Picks Item Sets That Matter -- Discovering Overlapping Communities of Named Entities -- Closed Non-derivable Itemsets -- Learning a Distance Metric for Object Identification Without Human Supervision -- Towards Association Rules with Hidden Variables -- A Data Mining Approach to the Joint Evaluation of Field and Manufacturing Data in Automotive Industry -- Incremental Aspect Models for Mining Document Streams -- Learning Approximate MRFs from Large Transaction Data -- Similarity Search for Multi-dimensional NMR-Spectra of Natural Products."]
[null,null,null,"Sommario/riassunto","The two premier annual European conferences in the areas of machine learning anddatamining havebeencollocatedeversincethejointconferenceinFreiburg, Germany,2001. The European Conference on Machine Learning wasestablished 20 years ago, when the ?rst European Working Session on Learning was "]
[{"$nulls":4},"held in Orsay, France, in 1986. The conference is growing, and is more lively than ever. The European Conference on Principles and Practice of Knowledge Discovery in Databasescelebratesits tenth anniversary;the ?rst PKDD took place in 1997 in Trondheim, Norway. Over the years, the ECML/PKDD series has evolved into one of the largest and most selective international conferences in these areas, the only one that provides a common forum for the two closely related ?elds. In 2006, the 6th collocated ECML/PKDD took place during September 18-22, when the Humboldt-Universität zu Berlin hosted the 17th European Conference on Machine Learning (ECML) and the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD). The successful model of a hierarchical reviewing process that was introduced last year for the ECML/PKDD 2005 in Porto has been taken over in 2006. We nominated 32 Area Chairs, each of them responsible for several closely related research topics. Suitable areas were selected on the basis of the submission s- tistics for ECML/PKDD 2005 to ensure a proper load balance among the Area Chairs. For the ?rst time, a joint Program Committee was nominated for the two conferences, consisting of 280 renowned researchers,mostly proposed by the AreaChairs."]