Results 1 - 10 of 45,293

Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations

by Jure Leskovec, Jon Kleinberg, Christos Faloutsos , 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract - Cited by 541 (48 self) - Add to MetaCart
How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include

Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

by Jiawei Han, Jian Pei, Yiwen Yin, Runying Mao - DATA MINING AND KNOWLEDGE DISCOVERY , 2004
"... Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still co ..."
Abstract - Cited by 1752 (64 self) - Add to MetaCart
-tree- based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth. Efficiency of mining is achieved with three techniques: (1) a large database is compressed into a condensed, smaller data structure, FP-tree which avoids costly, repeated database scans, (2) our

A tutorial on support vector machines for pattern recognition

by Christopher J. C. Burges - Data Mining and Knowledge Discovery , 1998
"... The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-separable data, working through a non-trivial example in detail. We describe a mechanical analogy, and discuss when SV ..."
Abstract - Cited by 3393 (12 self) - Add to MetaCart
large (even infinite) VC dimension by computing the VC dimension for homogeneous polynomial and Gaussian radial basis function kernels. While very high VC dimension would normally bode ill for generalization performance, and while at present there exists no theory which shows that good generalization

Data Preparation for Mining World Wide Web Browsing Patterns

by Robert Cooley, Bamshad Mobasher, Jaideep Srivastava - KNOWLEDGE AND INFORMATION SYSTEMS , 1999
"... The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth. An i ..."
Abstract - Cited by 567 (43 self) - Add to MetaCart
The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth

National debt in a neoclassical growth model.'

by Peter A Diamond - American Economic Review,
"... This paper contains a model designed to serve two purposes, to examine long-run competitive equilibrium in a growth model and then to explore the effects on this equilibrium of government debt. Samuelson [8] has examined the determination of interest rates in a singlecommodity world without durable ..."
Abstract - Cited by 698 (0 self) - Add to MetaCart
This paper contains a model designed to serve two purposes, to examine long-run competitive equilibrium in a growth model and then to explore the effects on this equilibrium of government debt. Samuelson [8] has examined the determination of interest rates in a singlecommodity world without

Do investment-cash flow sensitivities provide useful measures of financing constraints?

by Steven N. Kaplan, Luigi Zingales - QUARTERLY JOURNAL OF ECONOMICS , 1997
"... No. This paper investigates the relationship between financing constraints and investment-cash flow sensitivities by analyzing the firms identified by Fazzari, Hubbard, and Petersen as having unusually high investment-cash flow sensitivities. We find that firms that appear less financially constra ..."
Abstract - Cited by 687 (7 self) - Add to MetaCart
constrained exhibit significantly greater sensitivities than firms that appear more financially constrained. We find this pattern for the entire sample period, subperiods, and individual years. These results (and simple theoretical arguments) suggest that higher sensitivities cannot be interpreted as evidence

Dynamic programming algorithm optimization for spoken word recognition

by Hiroaki Sakoe, Seibi Chiba - IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING , 1978
"... This paper reports on an optimum dynamic programming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization is given using timewarping function. Then, two time-normalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract - Cited by 788 (3 self) - Add to MetaCart
the relative superiority of either a symmetric form of DP-matching or an asymmetric one. In the asymmetric form, time-normalization is achieved by trans-forming the time axis of a speech pattern onto that of the other. In the symmetric form, on the other hand, both time axes are transformed onto a temporarily

Stable isotope labeling by amino acids in cell culture, SILAC, as a simple and accurate approach to expression proteomics

by Shao-en Ong, Blagoy Blagoev, Irina Kratchmarova, Dan Bach Kristensen, Akhilesh P, Matthias Mann - Mol. Cell. Proteomics , 2002
"... The abbreviations used are: SILAC: Stable isotope labeling by amino acids in cell culture, 2DE: two dimensional (isoelectric focusing/SDS-PAGE) gel electrophoresis: ICATTM: isotope-coded affinity tag; MS: mass spectrometry; MALDI-TOF: matrix assisted laser desorption ionization-time of flight; PMF: ..."
Abstract - Cited by 595 (23 self) - Add to MetaCart
. Mammalian cell lines are grown in media lacking a standard essential amino acid but supplemented with a non-radioactive, isotopically labeled form of that amino acid, in this case deuterated leucine (Leu-d3). We find that growth of cells maintained in these media is no different from growth in normal media

Inductive-Data-Type Systems

by Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada , 2002
"... In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #-calA#Ik enriched by pattern-matching definitions folnitio a certain format,calat the "General Schem ..."
Abstract - Cited by 821 (23 self) - Add to MetaCart
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #-calA#Ik enriched by pattern-matching definitions folnitio a certain format,calat the "

High dimensional graphs and variable selection with the Lasso

by Nicolai Meinshausen, Peter Bühlmann - ANNALS OF STATISTICS , 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract - Cited by 736 (22 self) - Add to MetaCart
The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso
Results 1 - 10 of 45,293