000			08024nam a22005895i 4500
001			u374559
003			SIRSI
005			20160812084240.0
007			cr nn 008mamaa
008			100529s2010 gw | s |||| 0|eng d
020			_a9783642136726 _9978-3-642-13672-6
040			_cMX-MeUAM
050		4	_aQ334-342
050		4	_aTJ210.2-211.495
082	0	4	_a006.3 _223
100	1		_aZaki, Mohammed J. _eeditor.
245	1	0	_aAdvances in Knowledge Discovery and Data Mining _h[recurso electrónico] : _b14th Pacific-Asia Conference, PAKDD 2010, Hyderabad, India, June 21-24, 2010. Proceedings. Part II / _cedited by Mohammed J. Zaki, Jeffrey Xu Yu, B. Ravindran, Vikram Pudi.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_a520p. 161 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v6119
505	0		_aSession 4B. Dimensionality Reduction/Parallelism -- Subclass-Oriented Dimension Reduction with Constraint Transformation and Manifold Regularization -- Distributed Knowledge Discovery with Non Linear Dimensionality Reduction -- DPSP: Distributed Progressive Sequential Pattern Mining on the Cloud -- An Approach for Fast Hierarchical Agglomerative Clustering Using Graphics Processors with CUDA -- Session 5A. Novel Applications -- Ontology-Based Mining of Brainwaves: A Sequence Similarity Technique for Mapping Alternative Features in Event-Related Potentials (ERP) Data -- Combining Support Vector Machines and the t-statistic for Gene Selection in DNA Microarray Data Analysis -- Satrap: Data and Network Heterogeneity Aware P2P Data-Mining -- Player Performance Prediction in Massively Multiplayer Online Role-Playing Games (MMORPGs) -- Relevant Gene Selection Using Normalized Cut Clustering with Maximal Compression Similarity Measure -- Session 5B. Feature Selection/Visualization -- A Novel Prototype Reduction Method for the K-Nearest Neighbor Algorithm with K???1 -- Generalized Two-Dimensional FLD Method for Feature Extraction: An Application to Face Recognition -- Learning Gradients with Gaussian Processes -- Analyzing the Role of Dimension Arrangement for Data Visualization in Radviz -- Session 6A. Graph Mining -- Subgraph Mining on Directed and Weighted Graphs -- Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph -- A Framework for SQL-Based Mining of Large Graphs on Relational Databases -- Fast Discovery of Reliable k-terminal Subgraphs -- GTRACE2: Improving Performance Using Labeled Union Graphs -- Session 6B. Clustering II -- Orthogonal Nonnegative Matrix Tri-factorization for Semi-supervised Document Co-clustering -- Rule Synthesizing from Multiple Related Databases -- Fast Orthogonal Nonnegative Matrix Tri-Factorization for Simultaneous Clustering -- Hierarchical Web-Page Clustering via In-Page and Cross-Page Link Structures -- Mining Numbers in Text Using Suffix Arrays and Clustering Based on Dirichlet Process Mixture Models -- Session 7A. Opinion/Sentiment Mining -- Opinion-Based Imprecise Query Answering -- Blog Opinion Retrieval Based on Topic-Opinion Mixture Model -- Feature Subsumption for Sentiment Classification in Multiple Languages -- Decentralisation of ScoreFinder: A Framework for Credibility Management on User-Generated Contents -- Classification and Pattern Discovery of Mood in Weblogs -- Capture of Evidence for Summarization: An Application of Enhanced Subjective Logic -- Session 7B. Stream Mining -- Fast Perceptron Decision Tree Learning from Evolving Data Streams -- Classification and Novel Class Detection in Data Streams with Active Mining -- Bulk Loading Hierarchical Mixture Models for Efficient Stream Classification -- Summarizing Multidimensional Data Streams: A Hierarchy-Graph-Based Approach -- Efficient Trade-Off between Speed Processing and Accuracy in Summarizing Data Streams -- Subsequence Matching of Stream Synopses under the Time Warping Distance -- Session 8A. Similarity and Kernels -- Normalized Kernels as Similarity Indices -- Adaptive Matching Based Kernels for Labelled Graphs -- A New Framework for Dissimilarity and Similarity Learning -- Semantic-Distance Based Clustering for XML Keyword Search -- Session 8B. Graph Analysis -- oddball: Spotting Anomalies in Weighted Graphs -- Robust Outlier Detection Using Commute Time and Eigenspace Embedding -- EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs -- BASSET: Scalable Gateway Finder in Large Graphs -- Session 8C. Classification II -- Ensemble Learning Based on Multi-Task Class Labels -- Supervised Learning with Minimal Effort -- Generating Diverse Ensembles to Counter the Problem of Class Imbalance -- Relationship between Diversity and Correlation in Multi-Classifier Systems -- Compact Margin Machine.
520			_aThe14thPaci?c-AsiaConferenceonKnowledgeDiscoveryandData Mining was held in Hyderabad, India during June 21–24, 2010; this was the ?rst time the conference was held in India. PAKDDisamajorinternationalconferenceintheareasofdatamining (DM) and knowledge discovery in databases (KDD). It provides an international - rum for researchers and industry practitioners to share their new ideas, original research results and practical development experiences from all KDD-related areas including data mining, data warehousing, machine learning, databases, statistics, knowledge acquisition and automatic scienti?c discovery, data visu- ization, causal induction and knowledge-based systems. PAKDD-2010 received 412 research papers from over 34 countries incl- ing: Australia,Austria,Belgium, Canada,China, Cuba, Egypt,Finland, France, Germany, Greece, Hong Kong, India, Iran, Italy, Japan, S. Korea, Malaysia, Mexico,TheNetherlands,NewCaledonia,NewZealand,SanMarino,Singapore, Slovenia,Spain, Switzerland, Taiwan, Thailand, Tunisia, Turkey, UK, USA, and Vietnam. This clearly re?ects the truly international stature of the PAKDD conference. AfteraninitialscreeningofthepapersbytheProgramCommitteeChairs,for papers that did not conform to the submission guidelines or that were deemed not worthy of further reviews, 60 papers were rejected with a brief expla- tion for the decision. The remaining 352 papers were rigorously reviewed by at least three reviewers. The initial results were discussed among the reviewers and ?nally judged by the Program Committee Chairs. In some cases of c- ?ict additional reviews were sought. As a result of the deliberation process, only 42 papers (10.2%) were accepted as long presentations (25 mins), and an ad- tional 55 papers (13.3%) were accepted as short presentations (15 mins). The total acceptance rate was thus about 23.5% across both categories.
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aComputer software.
650		0	_aDatabase management.
650		0	_aInformation storage and retrieval systems.
650		0	_aInformation systems.
650		0	_aArtificial intelligence.
650	1	4	_aComputer Science.
650	2	4	_aArtificial Intelligence (incl. Robotics).
650	2	4	_aInformation Systems Applications (incl.Internet).
650	2	4	_aInformation Storage and Retrieval.
650	2	4	_aDatabase Management.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aComputer Communication Networks.
700	1		_aYu, Jeffrey Xu. _eeditor.
700	1		_aRavindran, B. _eeditor.
700	1		_aPudi, Vikram. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642136719
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6119
856	4	0	_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-13672-6
596			_a19
942			_cLIBRO_ELEC
999			_c202439 _d202439