Christos Faloutsos – författare
Visar alla böcker från författaren Christos Faloutsos. Handla med fri frakt och snabb leverans.
7 produkter
7 produkter
1 643 kr
Skickas inom 10-15 vardagar
Bridging the gap between the database and signal processing communities, this text provides the necessary background information for the reader and presents along intuition and mechanics of the best existing tools in each area. The first half of the text reviews the most successful database access methods, in increasing complexity, reaching up to spatial access methods and text retrieval. In all cases, the emphasis is on practical approaches that have been incorporated in commercial systems, or that seem very promising. The second half uses the above access methods to achieve fast searching in a database of signals. A general methodology is presented, which suggests extracting good features from each multimedia object, thus mapping objects into points in a metric space. Finally, the book concludes by presenting some recent successful applications of the methodology on time series and color images. This work is targeted towards researchers and developers of multimedia systems and can also serve as a textbook for a graduate course on multimedia searching, covering both access methods as well as the basics of signal processing.
2 125 kr
Skickas inom 10-15 vardagar
With the recent ?ourishing research activities on Web search and mining, social networkanalysis,informationnetworkanalysis,informationretrieval,linkana- sis,andstructuraldatamining,researchonlinkmininghasbeenrapidlygrowing, forminganew?eldofdatamining. Traditionaldataminingfocuseson"?at"or"isolated"datainwhicheachdata objectisrepresentedasanindependentattributevector. However,manyreal-world data sets are inter-connected, much richer in structure, involving objects of h- erogeneoustypesandcomplexlinks. Hence,thestudyoflinkminingwillhavea highimpactonvariousimportantapplicationssuchasWebandtextmining,social networkanalysis,collaborative?ltering,andbioinformatics. Asanemergingresearch?eld,therearecurrentlynobooksfocusingonthetheory andtechniquesaswellastherelatedapplicationsforlinkmining,especiallyfrom aninterdisciplinarypointofview. Ontheotherhand,duetothehighpopularity oflinkagedata,extensiveapplicationsrangingfromgovernmentalorganizationsto commercial businesses to people's daily life call for exploring the techniques of mininglinkagedata.Therefore,researchersandpractitionersneedacomprehensive booktosystematicallystudy,furtherdevelop,andapplythelinkminingtechniques totheseapplications. Thisbookcontainscontributedchaptersfromavarietyofprominentresearchers inthe?eld. Whilethechaptersarewrittenbydifferentresearchers,thetopicsand contentareorganizedinsuchawayastopresentthemostimportantmodels,al- rithms,andapplicationsonlinkmininginastructuredandconciseway. Giventhe lackofstructurallyorganizedinformationonthetopicoflinkmining,thebookwill provideinsightswhicharenoteasilyaccessibleotherwise. Wehopethatthebook willprovideausefulreferencetonotonlyresearchers,professors,andadvanced levelstudentsincomputersciencebutalsopractitionersinindustry. Wewouldliketoconveyourappreciationtoallauthorsfortheirvaluablec- tributions. WewouldalsoliketoacknowledgethatthisworkissupportedbyNSF throughgrantsIIS-0905215,IIS-0914934,andDBI-0960443. Chicago,Illinois PhilipS. Yu Urbana-Champaign,Illinois JiaweiHan Pittsburgh,Pennsylvania ChristosFaloutsos v Contents Part I Link-Based Clustering 1 Machine Learning Approaches to Link-Based Clustering...3 Zhongfei(Mark)Zhang,BoLong,ZhenGuo,TianbingXu, andPhilipS.Yu 2 Scalable Link-Based Similarity Computation and Clustering...45 XiaoxinYin,JiaweiHan,andPhilipS. Yu 3 Community Evolution and Change Point Detection in Time-Evolving Graphs...73 JimengSun,SpirosPapadimitriou,PhilipS. Yu,andChristosFaloutsos Part II Graph Mining and Community Analysis 4 A Survey of Link Mining Tasks for Analyzing Noisy and Incomplete Networks...107 GalileoMarkNamata,HossamSharara,andLiseGetoor 5 Markov Logic: A Language and Algorithms for Link Mining...135 PedroDomingos,DanielLowd,StanleyKok,AniruddhNath,Hoifung Poon,MatthewRichardson,andParagSingla 6 Understanding Group Structures and Properties in Social Media...163 LeiTangandHuanLiu 7 Time Sensitive Ranking with Application to Publication Search...187 XinLi,BingLiu,andPhilipS. Yu 8 Proximity Tracking on Dynamic Bipartite Graphs: Problem De?nitions and Fast Solutions...211 Hanghang Tong, Spiros Papadimitriou, Philip S. Yu, andChristosFaloutsos vii viii Contents 9 Discriminative Frequent Pattern-Based Graph Classi?cation...237 HongCheng,XifengYan,andJiaweiHan Part III Link Analysis for Data Cleaning and Information Integration 10 Information Integration for Graph Databases...265 Ee-PengLim,AixinSun,AnwitamanDatta,andKuiyuChang 11 Veracity Analysis and Object Distinction...283 XiaoxinYin,JiaweiHan,andPhilipS. Yu Part IV Social Network Analysis 12 Dynamic Community Identi?cation...
552 kr
Skickas inom 10-15 vardagar
The amount and the complexity of the data gathered by current enterprises are increasing at an exponential rate. Consequently, the analysis of Big Data is nowadays a central challenge in Computer Science, especially for complex data. For example, given a satellite image database containing tens of Terabytes, how can we find regions aiming at identifying native rainforests, deforestation or reforestation? Can it be made automatically? Based on the work discussed in this book, the answers to both questions are a sound “yes”, and the results can be obtained in just minutes. In fact, results that used to require days or weeks of hard work from human specialists can now be obtained in minutes with high precision. Data Mining in Large Sets of Complex Data discusses new algorithms that take steps forward from traditional data mining (especially for clustering) by considering large, complex datasets. Usually, other works focus in one aspect, either data size or complexity. This work considers both: it enables mining complex data from high impact applications, such as breast cancer diagnosis, region classification in satellite images, assistance to climate change forecast, recommendation systems for the Web and social networks; the data are large in the Terabyte-scale, not in Giga as usual; and very accurate results are found in just minutes. Thus, it provides a crucial and well timed contribution for allowing the creation of real time applications that deal with Big Data of high complexity in which mining on the fly can make an immeasurable difference, such as supporting cancer diagnosis or detecting deforestation.
1 643 kr
Skickas inom 10-15 vardagar
Searching Multimedia Databases by Content bridges the gap between the database and signal processing communities by providing the necessary background information for the reader and presenting it along with the intuition and mechanics of the best existing tools in each area. The first half of Searching Multimedia Databases by Content reviews the most successful database access methods, in increasing complexity, reaching up to spatial access methods and text retrieval. In all cases, the emphasis is on practical approaches that have been incorporated in commercial systems, or that seem very promising. The second half of the book uses the above access methods to achieve fast searching in a database of signals. A general methodology is presented, which suggests extracting a few good features from each multimedia object, thus mapping objects into points in a metric space. Finally, the book concludes by presenting some recent successful applications of the methodology on time series and color images. Searching Multimedia Databases by Content is targeted towards researchers and developers of multimedia systems. The book can also serve as a textbook for a graduate course on multimedia searching, covering both access methods as well as the basics of signal processing.
2 125 kr
Skickas inom 10-15 vardagar
With the recent ?ourishing research activities on Web search and mining, social networkanalysis,informationnetworkanalysis,informationretrieval,linkana- sis,andstructuraldatamining,researchonlinkmininghasbeenrapidlygrowing, forminganew?eldofdatamining. Traditionaldataminingfocuseson"?at"or"isolated"datainwhicheachdata objectisrepresentedasanindependentattributevector. However,manyreal-world data sets are inter-connected, much richer in structure, involving objects of h- erogeneoustypesandcomplexlinks. Hence,thestudyoflinkminingwillhavea highimpactonvariousimportantapplicationssuchasWebandtextmining,social networkanalysis,collaborative?ltering,andbioinformatics. Asanemergingresearch?eld,therearecurrentlynobooksfocusingonthetheory andtechniquesaswellastherelatedapplicationsforlinkmining,especiallyfrom aninterdisciplinarypointofview. Ontheotherhand,duetothehighpopularity oflinkagedata,extensiveapplicationsrangingfromgovernmentalorganizationsto commercial businesses to people's daily life call for exploring the techniques of mininglinkagedata.Therefore,researchersandpractitionersneedacomprehensive booktosystematicallystudy,furtherdevelop,andapplythelinkminingtechniques totheseapplications. Thisbookcontainscontributedchaptersfromavarietyofprominentresearchers inthe?eld. Whilethechaptersarewrittenbydifferentresearchers,thetopicsand contentareorganizedinsuchawayastopresentthemostimportantmodels,al- rithms,andapplicationsonlinkmininginastructuredandconciseway. Giventhe lackofstructurallyorganizedinformationonthetopicoflinkmining,thebookwill provideinsightswhicharenoteasilyaccessibleotherwise. Wehopethatthebook willprovideausefulreferencetonotonlyresearchers,professors,andadvanced levelstudentsincomputersciencebutalsopractitionersinindustry. Wewouldliketoconveyourappreciationtoallauthorsfortheirvaluablec- tributions. WewouldalsoliketoacknowledgethatthisworkissupportedbyNSF throughgrantsIIS-0905215,IIS-0914934,andDBI-0960443. Chicago,Illinois PhilipS. Yu Urbana-Champaign,Illinois JiaweiHan Pittsburgh,Pennsylvania ChristosFaloutsos v Contents Part I Link-Based Clustering 1 Machine Learning Approaches to Link-Based Clustering...3 Zhongfei(Mark)Zhang,BoLong,ZhenGuo,TianbingXu, andPhilipS.Yu 2 Scalable Link-Based Similarity Computation and Clustering...45 XiaoxinYin,JiaweiHan,andPhilipS. Yu 3 Community Evolution and Change Point Detection in Time-Evolving Graphs...73 JimengSun,SpirosPapadimitriou,PhilipS. Yu,andChristosFaloutsos Part II Graph Mining and Community Analysis 4 A Survey of Link Mining Tasks for Analyzing Noisy and Incomplete Networks...107 GalileoMarkNamata,HossamSharara,andLiseGetoor 5 Markov Logic: A Language and Algorithms for Link Mining...135 PedroDomingos,DanielLowd,StanleyKok,AniruddhNath,Hoifung Poon,MatthewRichardson,andParagSingla 6 Understanding Group Structures and Properties in Social Media...163 LeiTangandHuanLiu 7 Time Sensitive Ranking with Application to Publication Search...187 XinLi,BingLiu,andPhilipS. Yu 8 Proximity Tracking on Dynamic Bipartite Graphs: Problem De?nitions and Fast Solutions...211 Hanghang Tong, Spiros Papadimitriou, Philip S. Yu, andChristosFaloutsos vii viii Contents 9 Discriminative Frequent Pattern-Based Graph Classi?cation...237 HongCheng,XifengYan,andJiaweiHan Part III Link Analysis for Data Cleaning and Information Integration 10 Information Integration for Graph Databases...265 Ee-PengLim,AixinSun,AnwitamanDatta,andKuiyuChang 11 Veracity Analysis and Object Distinction...283 XiaoxinYin,JiaweiHan,andPhilipS. Yu Part IV Social Network Analysis 12 Dynamic Community Identi?cation...
378 kr
Skickas inom 10-15 vardagar
What does the Web look like? How can we find patterns, communities, outliers, in a social network? Which are the most central nodes in a network? These are the questions that motivate this work. Networks and graphs appear in many diverse settings, for example in social networks, computer-communication networks (intrusion detection, traffic management), protein-protein interaction networks in biology, document-text bipartite graphs in text retrieval, person-account graphs in financial fraud detection, and others. In this work, first we list several surprising patterns that real graphs tend to follow. Then we give a detailed list of generators that try to mirror these patterns. Generators are important, because they can help with "what if" scenarios, extrapolations, and anonymization. Then we provide a list of powerful tools for graph analysis, and specifically spectral methods (Singular Value Decomposition (SVD)), tensors, and case studies like the famous "pageRank" algorithm and the "HITS" algorithm for ranking web search results. Finally, we conclude with a survey of tools and observations from related fields like sociology, which provide complementary viewpoints. Table of Contents: Introduction / Patterns in Static Graphs / Patterns in Evolving Graphs / Patterns in Weighted Graphs / Discussion: The Structure of Specific Graphs / Discussion: Power Laws and Deviations / Summary of Patterns / Graph Generators / Preferential Attachment and Variants / Incorporating Geographical Information / The RMat / Graph Generation by Kronecker Multiplication / Summary and Practitioner's Guide / SVD, Random Walks, and Tensors / Tensors / Community Detection / Influence/Virus Propagation and Immunization / Case Studies / Social Networks / Other Related Work / Conclusions
Individual and Collective Graph Mining
Principles, Algorithms, and Applications
Häftad, Engelska, 2017
642 kr
Skickas inom 10-15 vardagar
Graphs naturally represent information ranging from links between web pages, to communication in email networks, to connections between neurons in our brains. These graphs often span billions of nodes and interactions between them. Within this deluge of interconnected data, how can we find the most important structures and summarize them? How can we efficiently visualize them? How can we detect anomalies that indicate critical events, such as an attack on a computer system, disease formation in the human brain, or the fall of a company?This book presents scalable, principled discovery algorithms that combine globality with locality to make sense of one or more graphs. In addition to fast algorithmic methodologies, we also contribute graph-theoretical ideas and models, and real-world applications in two main areas:Individual Graph Mining: We show how to interpretably summarize a single graph by identifying its important graph structures. We complement summarization with inference, which leverages information about few entities (obtained via summarization or other methods) and the network structure to efficiently and effectively learn information about the unknown entities.Collective Graph Mining: We extend the idea of individual-graph summarization to time-evolving graphs, and show how to scalably discover temporal patterns. Apart from summarization, we claim that graph similarity is often the underlying problem in a host of applications where multiple graphs occur (e.g., temporal anomaly detection, discovery of behavioral patterns), and we present principled, scalable algorithms for aligning networks and measuring their similarity.The methods that we present in this book leverage techniques from diverse areas, such as matrix algebra, graph theory, optimization, information theory, machine learning, finance, and social science,to solve real-world problems. We present applications of our exploration algorithms to massive datasets, including a Web graph of 6.6 billion edges, a Twitter graph of 1.8 billion edges, brain graphs with up to 90 million edges, collaboration, peer-to-peer networks, browser logs, all spanning millions of users and interactions.