Hiroshi Motoda – författare
Visar alla böcker från författaren . Handla med fri frakt och snabb leverans.
36 produkter
36 produkter
Inbunden, Engelska, 2001
1 662 kr
Skickas inom 10-15 vardagar
The ability to analyze and understand massive data sets lags far behind the ability to gather and store the data. To meet this challenge, knowledge discovery and data mining (KDD) is growing rapidly as an emerging field. However, no matter how powerful computers are now or will be in the future, KDD researchers and practitioners must consider how to manage ever-growing data which is, ironically, due to the extensive use of computers and ease of data collection with computers. Many different approaches have been used to address the data explosion issue, such as algorithm scale-up and data reduction. Instance, example, or tuple selection pertains to methods or algorithms that select or search for a representative portion of data that can fulfill a KDD task as if the whole data is used. Instance selection is directly related to data reduction and becomes increasingly important in many KDD applications due to the need for processing efficiency and/or storage efficiency. One of the major means of instance selection is sampling whereby a sample is selected for testing and analysis, and randomness is a key element in the process. Instance selection also covers methods that require search. Examples can be found in density estimation (finding the representative instances - data points - for a cluster); boundary hunting (finding the critical instances to form boundaries to differentiate data points of different classes); and data squashing (producing weighted new data with equivalent sufficient statistics). Other important issues related to instance selection extend to unwanted precision, focusing, concept drifts, noise/outlier removal, data smoothing, etc. Instance Selection and Construction for Data Mining brings researchers and practitioners together to report new developments and applications, to share hard-learned experiences in order to avoid similar pitfalls, and to shed light on the future development of instance selection. This volume serves as a comprehensive reference for graduate students, practitioners and researchers in KDD.
Inbunden, Engelska, 1998
2 213 kr
Skickas inom 10-15 vardagar
There is broad interest in feature extraction, construction, and selection among practitioners from statistics, pattern recognition, and data mining to machine learning. Data preprocessing is an essential step in the knowledge discovery process for real-world applications. This book compiles contributions from many leading and active researchers in this growing field and paints a picture of the state-of-art techniques that can boost the capabilities of many existing data mining tools. The objective of this collection is to increase the awareness of the data mining community about the research of feature extraction, construction and selection, which are currently conducted mainly in isolation. This book is part of our endeavor to produce a contemporary overview of modern solutions, to create synergy among these seemingly different branches, and to pave the way for developing meta-systems and novel approaches. Even with today's advanced computer technologies, discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Feature extraction, construction and selection are a set of techniques that transform and simplify data so as to make data mining tasks easier. Feature construction and selection can be viewed as two sides of the representation problem.
Inbunden, Engelska, 1998
3 647 kr
Skickas inom 10-15 vardagar
As computer power grows and data collection technologies advance, a plethora of data is generated in almost every field where computers are used. The com puter generated data should be analyzed by computers; without the aid of computing technologies, it is certain that huge amounts of data collected will not ever be examined, let alone be used to our advantages. Even with today's advanced computer technologies (e. g. , machine learning and data mining sys tems), discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Taking its simplest form, raw data are represented in feature-values. The size of a dataset can be measUJ·ed in two dimensions, number of features (N) and number of instances (P). Both Nand P can be enormously large. This enormity may cause serious problems to many data mining systems. Feature selection is one of the long existing methods that deal with these problems. Its objective is to select a minimal subset of features according to some reasonable criteria so that the original task can be achieved equally well, if not better. By choosing a minimal subset offeatures, irrelevant and redundant features are removed according to the criterion. When N is reduced, the data space shrinks and in a sense, the data set is now a better representative of the whole data population. If necessary, the reduction of N can also give rise to the reduction of P by eliminating duplicates.
E-bok
Engelska, 2007989 kr
Läs direkt efter köp
Due to increasing demands for dimensionality reduction, research on feature selection has deeply and widely expanded into many fields, including computational statistics, pattern recognition, machine learning, data mining, and knowledge discovery. Highlighting current research issues, Computational Methods of Feature Selection introduces the
Häftad, Engelska, 2010
1 662 kr
Skickas inom 10-15 vardagar
The ability to analyze and understand massive data sets lags far behind the ability to gather and store the data. To meet this challenge, knowledge discovery and data mining (KDD) is growing rapidly as an emerging field. However, no matter how powerful computers are now or will be in the future, KDD researchers and practitioners must consider how to manage ever-growing data which is, ironically, due to the extensive use of computers and ease of data collection with computers. Many different approaches have been used to address the data explosion issue, such as algorithm scale-up and data reduction. Instance, example, or tuple selection pertains to methods or algorithms that select or search for a representative portion of data that can fulfill a KDD task as if the whole data is used. Instance selection is directly related to data reduction and becomes increasingly important in many KDD applications due to the need for processing efficiency and/or storage efficiency. One of the major means of instance selection is sampling whereby a sample is selected for testing and analysis, and randomness is a key element in the process. Instance selection also covers methods that require search. Examples can be found in density estimation (finding the representative instances - data points - for a cluster); boundary hunting (finding the critical instances to form boundaries to differentiate data points of different classes); and data squashing (producing weighted new data with equivalent sufficient statistics). Other important issues related to instance selection extend to unwanted precision, focusing, concept drifts, noise/outlier removal, data smoothing, etc. Instance Selection and Construction for Data Mining brings researchers and practitioners together to report new developments and applications, to share hard-learned experiences in order to avoid similar pitfalls, and to shed light on the future development of instance selection. This volume serves as a comprehensive reference for graduate students, practitioners and researchers in KDD.
Häftad, Engelska, 2013
3 657 kr
Skickas inom 10-15 vardagar
As computer power grows and data collection technologies advance, a plethora of data is generated in almost every field where computers are used. The com puter generated data should be analyzed by computers; without the aid of computing technologies, it is certain that huge amounts of data collected will not ever be examined, let alone be used to our advantages. Even with today's advanced computer technologies (e. g. , machine learning and data mining sys tems), discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Taking its simplest form, raw data are represented in feature-values. The size of a dataset can be measUJ·ed in two dimensions, number of features (N) and number of instances (P). Both Nand P can be enormously large. This enormity may cause serious problems to many data mining systems. Feature selection is one of the long existing methods that deal with these problems. Its objective is to select a minimal subset of features according to some reasonable criteria so that the original task can be achieved equally well, if not better. By choosing a minimal subset offeatures, irrelevant and redundant features are removed according to the criterion. When N is reduced, the data space shrinks and in a sense, the data set is now a better representative of the whole data population. If necessary, the reduction of N can also give rise to the reduction of P by eliminating duplicates.
Häftad, Engelska, 2012
2 149 kr
Skickas inom 10-15 vardagar
There is broad interest in feature extraction, construction, and selection among practitioners from statistics, pattern recognition, and data mining to machine learning. Data preprocessing is an essential step in the knowledge discovery process for real-world applications. This book compiles contributions from many leading and active researchers in this growing field and paints a picture of the state-of-art techniques that can boost the capabilities of many existing data mining tools. The objective of this collection is to increase the awareness of the data mining community about the research of feature extraction, construction and selection, which are currently conducted mainly in isolation. This book is part of our endeavor to produce a contemporary overview of modern solutions, to create synergy among these seemingly different branches, and to pave the way for developing meta-systems and novel approaches. Even with today's advanced computer technologies, discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Feature extraction, construction and selection are a set of techniques that transform and simplify data so as to make data mining tasks easier. Feature construction and selection can be viewed as two sides of the representation problem.
E-bok
PDF, Engelska, 20124 542 kr
Läs direkt efter köp
As computer power grows and data collection technologies advance, a plethora of data is generated in almost every field where computers are used. The com puter generated data should be analyzed by computers; without the aid of computing technologies, it is certain that huge amounts of data collected will not ever be examined, let alone be used to our advantages. Even with today''s advanced computer technologies (e. g. , machine learning and data mining sys tems), discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Taking its simplest form, raw data are represented in feature-values. The size of a dataset can be measUJ·ed in two dimensions, number of features (N) and number of instances (P). Both Nand P can be enormously large. This enormity may cause serious problems to many data mining systems. Feature selection is one of the long existing methods that deal with these problems. Its objective is to select a minimal subset of features according to some reasonable criteria so that the original task can be achieved equally well, if not better. By choosing a minimal subset offeatures, irrelevant and redundant features are removed according to the criterion. When N is reduced, the data space shrinks and in a sense, the data set is now a better representative of the whole data population. If necessary, the reduction of N can also give rise to the reduction of P by eliminating duplicates.
E-bok
PDF, Engelska, 20122 833 kr
Läs direkt efter köp
There is broad interest in feature extraction, construction, and selection among practitioners from statistics, pattern recognition, and data mining to machine learning. Data preprocessing is an essential step in the knowledge discovery process for real-world applications. This book compiles contributions from many leading and active researchers in this growing field and paints a picture of the state-of-art techniques that can boost the capabilities of many existing data mining tools. The objective of this collection is to increase the awareness of the data mining community about the research of feature extraction, construction and selection, which are currently conducted mainly in isolation. This book is part of our endeavor to produce a contemporary overview of modern solutions, to create synergy among these seemingly different branches, and to pave the way for developing meta-systems and novel approaches. Even with today''s advanced computer technologies, discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Feature extraction, construction and selection are a set of techniques that transform and simplify data so as to make data mining tasks easier. Feature construction and selection can be viewed as two sides of the representation problem.
E-bok
PDF, Engelska, 20132 044 kr
Läs direkt efter köp
The ability to analyze and understand massive data sets lags far behind the ability to gather and store the data. To meet this challenge, knowledge discovery and data mining (KDD) is growing rapidly as an emerging field. However, no matter how powerful computers are now or will be in the future, KDD researchers and practitioners must consider how to manage ever-growing data which is, ironically, due to the extensive use of computers and ease of data collection with computers. Many different approaches have been used to address the data explosion issue, such as algorithm scale-up and data reduction. Instance, example, or tuple selection pertains to methods or algorithms that select or search for a representative portion of data that can fulfill a KDD task as if the whole data is used. Instance selection is directly related to data reduction and becomes increasingly important in many KDD applications due to the need for processing efficiency and/or storage efficiency. One of the major means of instance selection is sampling whereby a sample is selected for testing and analysis, and randomness is a key element in the process. Instance selection also covers methods that require search. Examples can be found in density estimation (finding the representative instances - data points - for a cluster); boundary hunting (finding the critical instances to form boundaries to differentiate data points of different classes); and data squashing (producing weighted new data with equivalent sufficient statistics). Other important issues related to instance selection extend to unwanted precision, focusing, concept drifts, noise/outlier removal, data smoothing, etc. Instance Selection and Construction for Data Mining brings researchers and practitioners together to report new developments and applications, to share hard-learned experiences in order to avoid similar pitfalls, and to shed light on the future development of instance selection. This volume serves as a comprehensive reference for graduate students, practitioners and researchers in KDD.
Inbunden, Engelska, 2007
2 670 kr
Skickas inom 3-6 vardagar
Due to increasing demands for dimensionality reduction, research on feature selection has deeply and widely expanded into many fields, including computational statistics, pattern recognition, machine learning, data mining, and knowledge discovery. Highlighting current research issues, Computational Methods of Feature Selection introduces the basic concepts and principles, state-of-the-art algorithms, and novel applications of this tool.The book begins by exploring unsupervised, randomized, and causal feature selection. It then reports on some recent results of empowering feature selection, including active feature selection, decision-border estimate, the use of ensembles with independent probes, and incremental feature selection. This is followed by discussions of weighting and local methods, such as the ReliefF family, k-means clustering, local feature relevance, and a new interpretation of Relief. The book subsequently covers text classification, a new feature selection score, and both constraint-guided and aggressive feature selection. The final section examines applications of feature selection in bioinformatics, including feature construction as well as redundancy-, ensemble-, and penalty-based feature selection. Through a clear, concise, and coherent presentation of topics, this volume systematically covers the key concepts, underlying principles, and inventive applications of feature selection, illustrating how this powerful tool can efficiently harness massive, high-dimensional data and turn it into valuable, reliable information.
E-bok
PDF, Engelska, 2007992 kr
Läs direkt efter köp
Due to increasing demands for dimensionality reduction, research on feature selection has deeply and widely expanded into many fields, including computational statistics, pattern recognition, machine learning, data mining, and knowledge discovery. Highlighting current research issues, Computational Methods of Feature Selection introduces the
Del 8178 - Lecture Notes in Computer Science
Behavior and Social Computing
International Workshop on Behavior and Social Informatics, BSI 2013, Gold Coast, Australia, April 14-17, and International Workshop on Behavior and Social Informatics and Computing, BSIC 2013, Beijing, China, August 3-9, 2013, Revised Selected Papers
Häftad, Engelska, 2013
559 kr
Skickas inom 10-15 vardagar
This book constitutes the thoroughly refereed proceedings of the International Workshops on Behavior and Social Informatics and Computing, BSIC 2013, held as collocated event of IJCAI 2013, in Beijing, China in August 2013 and the International Workshop on Behavior and Social Informatics, BSI 2013, held as satellite workshop of PAKDD 2013, in Gold Coast, Australia, in April 2013. The 23 papers presented were carefully reviewed and selected from 58 submissions. The papers study a wide range of techniques and methods for behavior/social-oriented analyses including behavioral and social interaction and network, behavioral/social patterns, behavioral/social impacts, the formation of behavioral/social-oriented groups and collective intelligence and behavioral/social intelligence emergence.
732 kr
Läs direkt efter köp
This book constitutes the thoroughly refereed proceedings of the International Workshops on Behavior and Social Informatics and Computing, BSIC 2013, held as collocated event of IJCAI 2013, in Beijing, China in August 2013 and the International Workshop on Behavior and Social Informatics, BSI 2013, held as satellite workshop of PAKDD 2013, in Gold Coast, Australia, in April 2013. The 23 papers presented were carefully reviewed and selected from 58 submissions. The papers study a wide range of techniques and methods for behavior/social-oriented analyses including behavioral and social interaction and network, behavioral/social patterns, behavioral/social impacts, the formation of behavioral/social-oriented groups and collective intelligence and behavioral/social intelligence emergence.
Del 8537 - Lecture Notes in Computer Science
Rough Sets and Intelligent Systems Paradigms
Second International Conference, RSEISP 2014, Granada and Madrid, Spain, July 9-13, 2014. Proceedings
Häftad, Engelska, 2014
559 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 23rd Australasian Joint Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2014, held in Granada and Madrid, Spain, in July 2014. RSEISP 2014 was held along with the 9th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2014, as a major part of the 2014 Joint Rough Set Symposium, JRS 2014. JRS 2014 received 40 revised full papers and 37 revised short papers which were carefully reviewed and selected from 120 submissions and presented in two volumes. This volume contains the papers accepted for the conference RSEISP 2014, as well as the three invited papers presented at the conference. The papers are organized in topical sections on plenary lecture and tutorial papers; foundations of rough set theory; granular computing and covering-based rough sets; applications of rough sets; induction of decision rules - theory and practice; knowledge discovery; spatial data analysis and spatial databases; information extraction from images.
E-bok
PDF, Engelska, 2014732 kr
Läs direkt efter köp
This book constitutes the refereed proceedings of the 23rd Australasian Joint Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2014, held in Granada and Madrid, Spain, in July 2014. RSEISP 2014 was held along with the 9th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2014, as a major part of the 2014 Joint Rough Set Symposium, JRS 2014. JRS 2014 received 40 revised full papers and 37 revised short papers which were carefully reviewed and selected from 120 submissions and presented in two volumes. This volume contains the papers accepted for the conference RSEISP 2014, as well as the three invited papers presented at the conference. The papers are organized in topical sections on plenary lecture and tutorial papers; foundations of rough set theory; granular computing and covering-based rough sets; applications of rough sets; induction of decision rules - theory and practice; knowledge discovery; spatial data analysis and spatial databases; information extraction from images.
Del 9078 - Lecture Notes in Computer Science
Advances in Knowledge Discovery and Data Mining
19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part II
Häftad, Engelska, 2015
559 kr
Skickas inom 10-15 vardagar
This two-volume set, LNAI 9077 + 9078, constitutes the refereed proceedings of the 19th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2015, held in Ho Chi Minh City, Vietnam, in May 2015.The proceedings contain 117 paper carefully reviewed and selected from 405 submissions. They have been organized in topical sections named: social networks and social media; classification; machine learning; applications; novel methods and algorithms; opinion mining and sentiment analysis; clustering; outlier and anomaly detection; mining uncertain and imprecise data; mining temporal and spatial data; feature extraction and selection; mining heterogeneous, high-dimensional, and sequential data; entity resolution and topic-modeling; itemset and high-performance data mining; and recommendations.
E-bok
PDF, Engelska, 2015732 kr
Läs direkt efter köp
This two-volume set, LNAI 9077 + 9078, constitutes the refereed proceedings of the 19th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2015, held in Ho Chi Minh City, Vietnam, in May 2015.
The proceedings contain 117 paper carefully reviewed and selected from 405 submissions. They have been organized in topical sections named: social networks and social media; classification; machine learning; applications; novel methods and algorithms; opinion mining and sentiment analysis; clustering; outlier and anomaly detection; mining uncertain and imprecise data; mining temporal and spatial data; feature extraction and selection; mining heterogeneous, high-dimensional, and sequential data; entity resolution and topic-modeling; itemset and high-performance data mining; and recommendations.
Del 9077 - Lecture Notes in Computer Science
Advances in Knowledge Discovery and Data Mining
19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part I
Häftad, Engelska, 2015
559 kr
Skickas inom 10-15 vardagar
This two-volume set, LNAI 9077 + 9078, constitutes the refereed proceedings of the 19th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2015, held in Ho Chi Minh City, Vietnam, in May 2015.The proceedings contain 117 paper carefully reviewed and selected from 405 submissions. They have been organized in topical sections named: social networks and social media; classification; machine learning; applications; novel methods and algorithms; opinion mining and sentiment analysis; clustering; outlier and anomaly detection; mining uncertain and imprecise data; mining temporal and spatial data; feature extraction and selection; mining heterogeneous, high-dimensional and sequential data; entity resolution and topic-modeling; itemset and high-performance data mining; and recommendations.
E-bok
PDF, Engelska, 2015732 kr
Läs direkt efter köp
This two-volume set, LNAI 9077 + 9078, constitutes the refereed proceedings of the 19th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2015, held in Ho Chi Minh City, Vietnam, in May 2015.
The proceedings contain 117 paper carefully reviewed and selected from 405 submissions. They have been organized in topical sections named: social networks and social media; classification; machine learning; applications; novel methods and algorithms; opinion mining and sentiment analysis; clustering; outlier and anomaly detection; mining uncertain and imprecise data; mining temporal and spatial data; feature extraction and selection; mining heterogeneous, high-dimensional and sequential data; entity resolution and topic-modeling; itemset and high-performance data mining; and recommendations.
Häftad, Engelska, 2005
559 kr
Skickas inom 10-15 vardagar
This volume contains the papers selected for presentation at the 2nd Inter- tional Workshop on Active Mining (AM 2003) which was organized in conju- tion with the 14th International Symposium on Methodologies for Intelligent Systems (ISMIS 2003), held in Maebashi City, Japan, 28-31 October, 2003. The workshop was organized by the Maebashi Institute of Technology in - operation with the Japanese Society for Arti?cial Intelligence. It was sponsored by the Maebashi Institute of Technology, the Maebashi Convention Bureau, the Maebashi City Government, the Gunma Prefecture Government, JSAI SIGKBS (Japanese Arti?cial Intelligence Society, Special Interest Group on Knowledge- Based Systems), a Grant-in-Aid for Scienti?c Research on Priority Areas (No. 759) "Implementation of Active Mining in the Era of Information Flood," US AFOSR/AOARD, the Web Intelligence Consortium (Japan), the Gunma Inf- mation Service Industry Association, and Ryomo Systems Co., Ltd. ISMIS is a conference series that was started in 1986 in Knoxville, Tennessee.SincethenithasbeenheldinCharlotte(NorthCarolina),Knoxville(Tennessee), Torin (Italy), Trondheim (Norway), Warsaw (Poland), Zakopane (Poland), and Lyon (France). The objective of this workshop was to gather researchers as well as prac- tioners who are working on various research ?elds of active mining, share ha- learned experiences, and shed light on the future development of active mining.
Häftad, Engelska, 2005
542 kr
Skickas inom 10-15 vardagar
This volume contains the papers presented at the 8th International Conference onDiscoveryScience(DS2005)heldinSingapore,RepublicofSingapore,during the days from 8-11 of October 2005. The main objective of the Discovery Science (DS) conference series is to p- vide an open forum for intensive discussions and the exchange of new ideas and information among researchers working in the area of automating scienti?c d- covery or working on tools for supporting the human process of discovery in science. It has been a successful arrangement in the past to co-locate the DS conference with the International Conference on Algorithmic Learning Theory (ALT). This combination of ALT and DS allows for a comprehensive treatment ofthewholerange,fromtheoreticalinvestigationstopracticalapplications.C- tinuing in this tradition, DS 2005 was co-located with the 16th ALT conference (ALT2005).TheproceedingsofALT 2005werepublished asa twinvolume3734 of the LNCS series. TheInternationalSteeringCommitteeoftheDiscoveryScienceconference- ries providedimportantadviceon a number ofissues during the planning of D- coveryScience2005.ThemembersoftheSteeringCommiteeareHiroshiMotoda, (Osaka University), Alberto Apostolico (Purdue University), Setsuo Arikawa (Kyushu University), Achim Ho?mann (University of New South Wales), Klaus P. Jantke (DFKI and FIT Leipzig, Germany), Massimo Melucci (U- versityofPadua),Masahiko Sato(Kyoto University),Ayumi Shinohara(Tohoku University),EinoshinSuzuki(YokohamaNationalUniversity),andThomasZe- mann (Hokkaido University). We received 112 full paper submissions out of which 21 long papers (up to 15 pages), 7 regular papers (up to 9 pages), and 9 project reports (3 pages) were acceptedforpresentationandarepublished inthis volume.Eachsubmissionwas reviewed by at least two members of the Program Committee of international expertsinthe?eld.Theselectionwasmadeaftercarefulevaluationofeachpaper based on originality, technical quality, relevance to the ?eld of discovery science, and clarity.
E-bok
PDF, Engelska, 2005710 kr
Läs direkt efter köp
E-bok
PDF, Engelska, 2005712 kr
Läs direkt efter köp
E-bok
PDF, Engelska, 2003710 kr
Läs direkt efter köp
This book constitutes the refereed proceedings of the First International Conference on Discovery Science, DS''98, held in Fukuoka, Japan, in December 1998.The volume presents 28 revised full papers selected from a total of 76 submissions. Also included are five invited contributions and 34 selected poster presentations. The ultimate goal of DS''98 and this volume is to establish discovery science as a new field of research and development. The papers presented relate discovery science to areas as formal logic, knowledge processing, machine learning, automated deduction, searching, neural networks, database management, information retrieval, intelligent network agents, visualization, knowledge discovery, data mining, information extraction, etc.
Häftad, Engelska, 1998
1 110 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence, PRICAI'98, held in Singapore, in November 1998.The 56 revised papers presented were carefully reviewed and selected from a total of 197 submissions received from 25 countries. The papers are organized in sections on induction; multi-agent architecture; knowledge acquisition, modeling and validation; reasoning; knowledge discovery and data mining; knowledge management; application of fuzzy logic; applications of neural networks; searching; Bayesian networks; text analysis; knowledge structure; inductive logic programming; intelligent systems; foundations of AI; stochastic processes; abduction; information retrieval and speech recognition.
Häftad, Engelska, 1998
542 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the First International Conference on Discovery Science, DS'98, held in Fukuoka, Japan, in December 1998.The volume presents 28 revised full papers selected from a total of 76 submissions. Also included are five invited contributions and 34 selected poster presentations. The ultimate goal of DS'98 and this volume is to establish discovery science as a new field of research and development. The papers presented relate discovery science to areas as formal logic, knowledge processing, machine learning, automated deduction, searching, neural networks, database management, information retrieval, intelligent network agents, visualization, knowledge discovery, data mining, information extraction, etc.
Häftad, Engelska, 2013
559 kr
Skickas inom 10-15 vardagar
The two-volume set LNAI 7818 + LNAI 7819 constitutes the refereed proceedings of the 17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013, held in Gold Coast, Australia, in April 2013. The total of 98 papers presented in these proceedings was carefully reviewed and selected from 363 submissions. They cover the general fields of data mining and KDD extensively, including pattern mining, classification, graph mining, applications, machine learning, feature selection and dimensionality reduction, multiple information sources mining, social networks, clustering, text mining, text classification, imbalanced data, privacy-preserving data mining, recommendation, multimedia data mining, stream data mining, data preprocessing and representation.
E-bok
PDF, Engelska, 2013732 kr
Läs direkt efter köp
The two-volume set LNAI 7818 + LNAI 7819 constitutes the refereed proceedings of the 17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013, held in Gold Coast, Australia, in April 2013. The total of 98 papers presented in these proceedings was carefully reviewed and selected from 363 submissions. They cover the general fields of data mining and KDD extensively, including pattern mining, classification, graph mining, applications, machine learning, feature selection and dimensionality reduction, multiple information sources mining, social networks, clustering, text mining, text classification, imbalanced data, privacy-preserving data mining, recommendation, multimedia data mining, stream data mining, data preprocessing and representation.
Häftad, Engelska, 2013
559 kr
Skickas inom 10-15 vardagar
The two-volume set LNAI 7818 + LNAI 7819 constitutes the refereed proceedings of the 17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013, held in Gold Coast, Australia, in April 2013. The total of 98 papers presented in these proceedings was carefully reviewed and selected from 363 submissions. They cover the general fields of data mining and KDD extensively, including pattern mining, classification, graph mining, applications, machine learning, feature selection and dimensionality reduction, multiple information sources mining, social networks, clustering, text mining, text classification, imbalanced data, privacy-preserving data mining, recommendation, multimedia data mining, stream data mining, data preprocessing and representation.