{"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":31,"n_cols":5,"rows_kept":31,"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],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[22,2,22,3],[23,2,23,3],[27,2,27,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465690603316"]
[null,null,"Titolo",null,"Advanced Data Mining and Applications [[electronic resource] ] : 6th International Conference, ADMA 2010, Chongqing, China, November 19-21, 2010, Proceedings, Part I / / edited by Longbing Cao, Yong Feng, Jiang Zhong"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-39049-2"]
[{"$nulls":4},"9786613568410"]
[{"$nulls":4},"3-642-17316-0"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 628 p. 221 illus.)"]
[null,null,"Collana",null,"Lecture Notes in Artificial Intelligence ; ; 6440"]
[null,null,"Disciplina",null,"006.3"]
[null,null,"Soggetti",null,"Artificial intelligence"]
[{"$nulls":4},"Computer communication systems"]
[{"$nulls":4},"Application software"]
[{"$nulls":4},"Information storage and retrieval"]
[{"$nulls":4},"Database management"]
[{"$nulls":4},"Data mining"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Information Systems Applications (incl. Internet)"]
[{"$nulls":4},"Information Storage and Retrieval"]
[{"$nulls":4},"Database Management"]
[{"$nulls":4},"Data Mining and Knowledge Discovery"]
[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,"Data Mining Foundations -- Cost Sensitive Classification in Data Mining -- Web Users Access Paths Clustering Based on Possibilistic and Fuzzy Sets Theory -- Discriminative Markov Logic Network Structure Learning Based on Propositionalization and ? 2-Test -- EWGen: Automatic Generation of Item Weights for Weighted Association Rule Mining -- Best Clustering Configuration Metrics: Towards Multiagent Based Clustering -- On Probabilistic Models for Uncertain Sequential Pattern Mining -- Cube Based Summaries of Large Association Rule Sets -- A Perceptron-Like Linear Supervised Algorithm for Text Classification -- "]
[{"$nulls":4},"Research on Time Series Forecasting Model Based on Moore Automata -- A Clustering Algorithm FCM-ACO for Supplier Base Management -- Nearest Neighbour Distance Matrix Classification -- Classification Inductive Rule Learning with Negated Features -- Fast Retrieval of Time Series Using a Multi-resolution Filter with Multiple Reduced Spaces -- DHPTID-HYBRID Algorithm: A Hybrid Algorithm for Association Rule Mining -- An Improved Rough Clustering Using Discernibility Based Initial Seed Computation -- Fixing the Threshold for Effective Detection of Near Duplicate Web Documents in Web Crawling -- Topic-Constrained Hierarchical Clustering for Document Datasets -- Discretization of Time Series Dataset Using Relative Frequency and K-Nearest Neighbor Approach -- MSDBSCAN: Multi-density Scale-Independent Clustering Algorithm Based on DBSCAN -- An Efficient Algorithm for Mining Erasable Itemsets -- Discord Region Based Analysis to Improve Data Utility of Privately Published Time Series -- Deep Web Sources Classifier Based on DSOM-EACO Clustering Model -- Kernel Based K-Medoids for Clustering Data with Uncertainty -- Frequent Pattern Mining Using Modified CP-Tree for Knowledge Discovery -- Spatial Neighborhood Clustering Based on Data Field -- Surrounding Influenced K-Nearest Neighbors: A New Distance Based Classifier -- A Centroid k-Nearest Neighbor Method -- Mining Spatial Association Rules with Multi-relational Approach -- An Unsupervised Classification Method of Remote Sensing Images Based on Ant Colony Optimization Algorithm -- A Novel Clustering Algorithm Based on Gravity and Cluster Merging -- Data Mining in Specific Areas -- Evolution Analysis of a Mobile Social Network -- Distance Distribution and Average Shortest Path Length Estimation in Real-World Networks -- Self-adaptive Change Detection in Streaming Data with Non-stationary Distribution -- Anchor Points Seeking of Large Urban Crowd Based on the Mobile Billing Data -- Frequent Pattern Trend Analysis in Social Networks -- Efficient Privacy-Preserving Data Mining in Malicious Model -- Analyze the Wild Birds’ Migration Tracks by MPI-Based Parallel Clustering Algorithm -- Formal Concept Analysis Based Clustering for Blog Network Visualization -- Finding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach -- Weigted-FP-Tree Based XML Query Pattern Mining -- Privacy-Preserving Data Mining in Presence of Covert Adversaries -- Multiple Level Views on the Adherent Cohesive Subgraphs in Massive Temporal Call Graphs -- Combating Link Spam by Noisy Link Analysis -- High Dimensional Image Categorization -- Efficiently Mining Co-Location Rules on Interval Data -- Multiple Attribute Frequent Mining-Based for Dengue Outbreak -- A Top-Down Approach for Hierarchical Cluster Exploration by Visualization -- Distributed Frequent Items Detection on Uncertain Data -- Mining Uncertain Sentences with Multiple Instance Learning -- WeightLOFCC: A Heuristic Weight-Setting Strategy of LOF Applied to Outlier Detection in Time Series Data -- TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support -- Research on Similarity Matching for Multiple Granularities Time-Series Data -- A Novel Algorithm for Hierarchical Community Structure Detection in Complex Networks -- Investigating Sequential Patterns of DNS Usage and Its Applications -- Key Issues and Theoretical Framework on Moving Objects Data Mining -- An Improved KNN Based Outlier Detection Algorithm for Large Datasets -- Some Developments of Determinacy Analysis -- A New Computational Framework for Gene Expression Clustering -- Forecasting Short-Term Trends of Stock Markets Based on Fuzzy Frequent Pattern Tree -- Inspired Rule-Based User Identification."]
[null,null,null,"Sommario/riassunto","With the ever-growing power of generating, transmitting, and "]
[{"$nulls":4},"collecting huge amounts of data, information overloadis nowan imminent problemto mankind. The overwhelming demand for information processing is not just about a better understanding of data, but also a better usage of data in a timely fashion. Data mining, or knowledge discovery from databases, is proposed to gain insight into aspects ofdata and to help peoplemakeinformed,sensible,and better decisions. At present, growing attention has been paid to the study, development, and application of data mining. As a result there is an urgent need for sophisticated techniques and toolsthat can handle new ?elds of data mining, e. g. , spatialdata mining, biomedical data mining, and mining on high-speed and time-variant data streams. The knowledge of data mining should also be expanded to new applications. The 6th International Conference on Advanced Data Mining and Appli- tions(ADMA2010)aimedtobringtogethertheexpertsondataminingthrou- out the world. It provided a leading international forum for the dissemination of original research results in advanced data mining techniques, applications, al- rithms, software and systems, and di?erent applied disciplines. The conference attracted 361 online submissions from 34 di?erent countries and areas. All full papers were peer reviewed by at least three members of the Program Comm- tee composed of international experts in data mining ?elds. A total number of 118 papers were accepted for the conference. Amongst them, 63 papers were selected as regular papers and 55 papers were selected as short papers."]