@inproceedings{Ho98, address = {Granada}, author = {Hovy, E.H.}, booktitle = {Proc. 1st Intl. Conf. on Language Resources and Evaluation (LREC)}, interhash = {c8f274dc0380d76b5bb179152c47a959}, intrahash = {839e408657e0d8d6ca0b66fdae29063f}, isbn = {3-540-41066-X}, title = {Combining and Standardizing Large-Scale, Practical Ontologies for Machine Translation and Other Uses}, url = {http://www.isi.edu/natural-language/people/hovy/publications.html}, year = 1998 } @misc{citeulike:95936, abstract = {The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O(m d log n) where d is the depth of the dendrogram describing the community structure. Many real-world networks are sparse and hierarchical, with m ~ n and d ~ log n, in which case our algorithm runs in essentially linear time, O(n log^2 n). As an example of the application of this algorithm we use it to analyze a network of items for sale on the web-site of a large online retailer, items in the network being linked if they are frequently purchased by the same buyer. The network has more than 400,000 vertices and 2 million edges. We show that our algorithm can extract meaningful communities from this network, revealing large-scale patterns present in the purchasing habits of customers.}, author = {Clauset, Aaron and Newman, M. E. J. and Moore, Cristopher}, citeulike-article-id = {95936}, eprint = {cond-mat/0408187}, interhash = {2c68e3c981a00380692a3b0b661d7cfd}, intrahash = {f9a12630a6d31d576ea5222219a4cf0b}, month = {August}, priority = {0}, title = {Finding community structure in very large networks}, url = {http://arxiv.org/abs/cond-mat/0408187}, year = 2004 } @article{clauset-2004-70, author = {Clauset, Aaron and Newman, M.E.J. and Moore, Cristopher}, interhash = {2c68e3c981a00380692a3b0b661d7cfd}, intrahash = {a35d69f1d41a6cdd0632c5e1cadb4d44}, journal = {Physical Review E}, pages = 066111, title = {Finding community structure in very large networks}, url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0408187}, volume = 70, year = 2004 } @inproceedings{kubicaKgroups, author = {Kubica, Jeremy and Moore, Andrew and Schneider, Jeff}, booktitle = {The Third IEEE International Conference on Data Mining}, editor = {Wu, Xindong and Tuzhilin, Alex and Shavlik, Jude}, interhash = {0d7be00e85fa41a082bab454c0665126}, intrahash = {a2602433bd2f144216fdddd3704d487f}, month = {November}, pages = {573-576}, publisher = {IEEE Computer Society}, title = {Tractable Group Detection on Large Link Data Sets}, year = 2003 } @techreport{Kubica_2003_4489, abstract = {Discovering underlying structure from co-occurrence data is an important task in many fields, including: insurance, intelligence, criminal investigation, epidemiology, human resources, and marketing. For example a store may wish to identify underlying sets of items purchased together or a human resources department may wish to identify groups of employees that collaborate with each other. Previously Kubica et. al. presented the group detection algorithm (GDA) - an algorithm for finding underlying groupings of entities from co-occurrence data. This algorithm is based on a probabilistic generative model and produces coherent groups that are consistent with prior knowledge. Unfortunately, the optimization used in GDA is slow, making it potentially infeasible for many real world data sets. To this end, we present k-groups - an algorithm that uses an approach similar to that of k-means (hard clustering and localized updates) to significantly accelerate the discovery of the underlying groups while retaining GDA's probabilistic model. In addition, we show that k-groups is guaranteed to converge to a local minimum. We also compare the performance of GDA and k-groups on several real world and artificial data sets, showing that k-groups' sacrifice in solution quality is significantly offset by its increase in speed. This trade-off makes group detection tractable on significantly larger data sets.}, address = {Pittsburgh, PA}, author = {Kubica, Jeremy Martin and Moore, Andrew and Schneider, Jeff}, institution = {Robotics Institute, Carnegie Mellon University}, interhash = {cecbc69533ab6d63fd478c7a9c7651a1}, intrahash = {3a4df0e814c3a1b125e3d403abe48733}, month = {September}, number = {CMU-RI-TR-03-32}, title = {K-groups: Tractable Group Detection on Large Link Data Sets}, url = {http://www.ri.cmu.edu/pubs/pub_4489.html}, year = 2003 } @article{clauset-2004-70, author = {Clauset, Aaron and Newman, M. E. J. and Moore, Cristopher}, interhash = {2c68e3c981a00380692a3b0b661d7cfd}, intrahash = {0ea285bfc0f5a46ffec8a213e5133ba6}, journal = {Physical Review E}, pages = 066111, title = {Finding community structure in very large networks}, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0408187}, volume = 70, year = 2004 } @inproceedings{zhang96birch, author = {Zhang, Tian and Ramakrishnan, Raghu and Livny, Miron}, booktitle = {Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (SIGMOD'96)}, interhash = {bd3d8e33e8785ecf66408081db016ca4}, intrahash = {d8ede3f66d485d95578bdc3eeda11fc3}, pages = {103--114}, title = {{BIRCH}: an efficient data clustering method for very large databases}, url = {http://citeseer.ist.psu.edu/zhang96birch.html}, year = 1996 } @inproceedings{conf/sigmod/WangWYY02, author = {Wang, Haixun and 0010, Wei Wang and Yang, Jiong and Yu, Philip S.}, booktitle = {SIGMOD Conference}, crossref = {conf/sigmod/2002}, date = {2009-06-28}, editor = {Franklin, Michael J. and Moon, Bongki and Ailamaki, Anastassia}, ee = {http://doi.acm.org/10.1145/564691.564737}, interhash = {9da0e61a2ac3ac371edfb251fbbfc2ae}, intrahash = {5ad941d8f0a06bb5e570e22a8cc58d92}, isbn = {1-58113-497-5}, pages = {394-405}, publisher = {ACM}, title = {Clustering by pattern similarity in large data sets.}, url = {http://dblp.uni-trier.de/db/conf/sigmod/sigmod2002.html#WangWYY02}, year = 2002 } @book{cullum2002lanczos, author = {Cullum, J.K. and Willoughby, R.A.}, interhash = {cfc97672c78c590391fc6f731d48ddc2}, intrahash = {b6fa6a375178396d472af2006fb21fc8}, publisher = {Society for Industrial Mathematics}, title = {{Lanczos algorithms for large symmetric eigenvalue computations: Theory}}, url = {http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0}, year = 2002 } @article{356494, abstract = { Algorithms for sparse Gaussian elimination with partial pivoting
ACM Portal HeBIS: Universitaetsbibliothek Kassel
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Algorithms for sparse Gaussian elimination with partial pivoting
Full text PdfPdf (564 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 4 ,  Issue 4  (December 1978) table of contents
Pages: 330 - 338  
Year of Publication: 1978
ISSN:0098-3500
Author
Andrew H Sherman  Department of Computer Sciences, Painter 328, The University of Texas at Austin, Austin, TX
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 58,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/356502.356494
What is a DOI?

REFERENCES
 
1
Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
 
2
CURTIS, A.R., AND REID, J.K. FORTRAN subroutines for the solution of sparse sets of hnear equations. AERE Rep. R6844, AERE HarweU, England, 1971.
 
3
CURTIS, A.R, AND REID, J.K The solution of large sparse unsymmetnc systems of hnear equations. Information Processing '71 (1971), 1240-1245.
 
4
DUFF, I.S., AND REID, J.K A comparison of sparsity ordermgs for obtaining a pivotal sequence in Gausslan elm~matlon. AERE Rep. T.P. 526, AERE Harwell, England, 1973
5
Stanley C. Eisenstat , Andrew H. Sherman, Efficient implementation of sparse nonsymmetric Gaussian elimination without pivoting (abstract), ACM SIGNUM Newsletter, v.10 n.4, p.26-29, December 1975  [doi>10.1145/1053205.1053217]
 
6
FORSYTHE, G.E., AND MOLER, C B Computer Solutton of Linear Algebraic Systems Prentice- Hall, Englewood Cliffs, N J, 1967
 
7
Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998

CITED BY  2
Andrew H. Sherman, Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4], ACM Transactions on Mathematical Software (TOMS), v.4 n.4, p.391-398, December 1978
Jing Li , Tao Jiang, Efficient rule-based haplotyping algorithms for pedigree data, Proceedings of the seventh annual international conference on Research in computational molecular biology, p.197-206, April 10-14, 2003, Berlin, Germany

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.3 Numerical Linear Algebra
          Subjects: Sparse, structured, and very large systems (direct and iterative methods)

Additional Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.3 Numerical Linear Algebra
          Subjects: Linear systems (direct and iterative methods)


General Terms:
Algorithms


Keywords:
analysis of algorithms, linear equations, pivoting algorithms, sparse Gaussian elimination, sparse linear systems

Collaborative Colleagues:
Andrew H Sherman: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
}, address = {New York, NY, USA}, author = {Sherman, Andrew H}, doi = {http://doi.acm.org/10.1145/356502.356494}, interhash = {abdfc22d990fc6bc077527abf2e2c344}, intrahash = {3d4ed208d8092e541d7c7f4d19d9e607}, issn = {0098-3500}, journal = {ACM Trans. Math. Softw.}, number = 4, pages = {330--338}, publisher = {ACM}, title = {Algorithms for sparse Gaussian elimination with partial pivoting}, url = {http://portal.acm.org/citation.cfm?id=356494}, volume = 4, year = 1978 } @article{berry1993svdpackc, author = {Berry, M. and Do, T. and O’Brien, G. and Krishna, V. and Varadhan, S.}, interhash = {ee044096cd5326538d8e8173c9d41e1a}, intrahash = {f6673604e495c6d457150f6c68cc90b9}, journal = {University of Tennessee}, publisher = {Citeseer}, title = {{SVDPACKC (version 1.0) user's guide}}, url = {http://scholar.google.de/scholar.bib?q=info:Y2fs0GQQ_LIJ:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0}, year = 1993 } @article{binder2005phylogenetic, abstract = {Phylogenetic relationships of resupinate Homobasidiomycetes (Corticiaceae s. lat. and others) were studied using ribosomal DNA (rDNA) sequences from a broad sample of resupinate and nonresupinate taxa. Two datasets were analysed using parsimony, a'core'dataset of 142 species, each of which is represented by four rDNA regions (mitochondrial and nuclear large and small subunits), and a 'full' clataset of 656 species, most of which were represented only by nuclear large subunit rDNA sequences. Both datasets were analysed using traditional heuristic methods with bootstrapping, and the full clataset was also analysed with the Parsimony Ratchet, using equal character weights and six-parameter weighted parsimony. Analyses of both datasets supported monophyly of the eight major clades of Homobasicliomycetes recognised by Hibbett and Thorn, as well as independent lineages corresponding to the Gloeophyllum clade, corticioid clade and jaapia argillacea. Analyses of the full clataset resolved two additional groups, the athelioid clade and trechisporoid clade (the latter may be nested in the polyporoid clade). Thus, there are at least 12 independent clades of Homobasicliomycetes. Higher-level relationships among the major clades are not resolved with confidence. Nevertheless, the euagarics clade, bolete clade, athelioid clade and jaapia argillacea are consistently resolved as a monophyletic group, whereas the cantharelloid clade, gomphoid-phalloid clade and hymenochaetoid clade are placed at the base of the Homobasidiomycetes, which is consistent with the preponderance of imperforate parenthesomes in those groups. Resupinate forms occur in each of the major clades of Homobasidiomycetes, some of which are composed mostly or exclusively of resupinate forms (athelioid clade, corticioid clade, trechisporoid clade,jaapia). The largest concentrations of resupinate forms occur in the polyporoid clade, russuloid clade and hymenochaetoid clade. The cantharelloid clade also includes many resupinate forms, including some that have traditionally been regarded as heterobasidiomycetes (Sebacinaceae, Tulasnellates, Ceratobasidiales). The euagarics clade, which is by far the largest clade in the Homobasidiomycetes, has the smallest fraction of resupinate species. Results of the present study are compared with recent phylogenetic analyses, and a table summarising the phylogenetic distribution of resupinate taxa is presented, as well as notes on the ecology of resupinate forms and related Homobasidiomycetes.}, author = {Binder, M. and Hibbett, D. S. and Larsson, K. H. and Larsson, E. and Langer, E. and Langer, G.}, interhash = {35bd7f6066d30b80cb445969c9aa3ae4}, intrahash = {a22933b7525f34cc68071d25347e4519}, journal = {Systematics and Biodiversity}, month = jun, number = 2, pages = {113-157}, title = {The phylogenetic distribution of resupinate forms across the major clades of mushroom-forming fungi (Homobasidiomycetes)}, url = {/brokenurl#://000231684600001}, volume = 3, year = 2005 } @misc{yu2013largescale, abstract = {The multi-label classification problem has generated significant interest in recent years. However, existing approaches do not adequately address two key challenges: (a) the ability to tackle problems with a large number (say millions) of labels, and (b) the ability to handle data with missing labels. In this paper, we directly address both these problems by studying the multi-label problem in a generic empirical risk minimization (ERM) framework. Our framework, despite being simple, is surprisingly able to encompass several recent label-compression based methods which can be derived as special cases of our method. To optimize the ERM problem, we develop techniques that exploit the structure of specific loss functions - such as the squared loss function - to offer efficient algorithms. We further show that our learning framework admits formal excess risk bounds even in the presence of missing labels. Our risk bounds are tight and demonstrate better generalization performance for low-rank promoting trace-norm regularization when compared to (rank insensitive) Frobenius norm regularization. Finally, we present extensive empirical results on a variety of benchmark datasets and show that our methods perform significantly better than existing label compression based methods and can scale up to very large datasets such as the Wikipedia dataset.}, author = {Yu, Hsiang-Fu and Jain, Prateek and Kar, Purushottam and Dhillon, Inderjit S.}, interhash = {1252173520757338468a68e028494647}, intrahash = {716e5270c1dcb3a1e4eedf9934859021}, note = {cite arxiv:1307.5101}, title = {Large-scale Multi-label Learning with Missing Labels}, url = {http://arxiv.org/abs/1307.5101}, year = 2013 }