Another Word For It Patrick Durusau on Topic Maps and Semantic Diversity

September 21, 2011

Online Master of Science in Predictive Analytics

Filed under: Computer Science,CS Lectures,Degree Program,Library,Prediction — Patrick Durusau @ 7:07 pm

Online Master of Science in Predictive Analytics

As businesses seek to maximize the value of vast new stores of available data, Northwestern University’s Master of Science in Predictive Analytics program prepares students to meet the growing demand in virtually every industry for data-driven leadership and problem solving.

Advanced data analysis, predictive modeling, computer-based data mining, and marketing, web, text, and risk analytics are just some of the areas of study offered in the program. As a student in the Master of Science in Predictive Analytics program, you will:

  • Prepare for leadership-level career opportunities by focusing on statistical concepts and practical application
  • Learn from distinguished Northwestern faculty and from the seasoned industry experts who are redefining how data improve decision-making and boost ROI
  • Build statistical and analytic expertise as well as the management and leadership skills necessary to implement high-level, data-driven decisions
  • Earn your Northwestern University master’s degree entirely online

Just so you know, libraries schools were offering mostly online degrees a decade or so ago. Nice to see other disciplines catching up. 😉

It would be interesting to see short courses in subject analysis, as in subject identity and the properties that compose a particular identity, in specific domains.

September 16, 2011

Open Textbooks – Computer Science

Filed under: CS Lectures — Patrick Durusau @ 6:42 pm

Open Textbooks – Computer Science

From the “about” page:

The Community College Open Textbooks Collaborative is funded by The William and Flora Hewlett Foundation. This collection of sixteen educational non-profit and for-profit organizations, affiliated with more than 200 colleges, is focused on driving awareness and adoptions of open textbooks to more than 2000 community and other two-year colleges. This includes providing training for instructors adopting open resources, peer reviews of open textbooks, and mentoring online professional networks that support for authors opening their resources, and other services.

….
College Open Textbooks has peer-reviewed more than 100 open textbooks for use in community college courses and identified more than 550: College Open Textbooks has already peer-reviewed several new open textbooks for use in community college courses and identified more than 250 others for consideration. Open textbooks are freely available for use without restriction and can be downloaded or printed from web sites and repositories.

There is a respectable listing of works under computer science.

This is a resource to use, recommend to others, and to support by contributing open textbooks.

Scientific and Technical Information (STI)

Filed under: CS Lectures,Library — Patrick Durusau @ 6:40 pm

Scientific and Technical Information (STI)

From the “about” page:

STI (scientific and technical information) is the collected set of facts, analyses, and conclusions resulting from scientific, technical, and related engineering research and development efforts, both basic and applied.

That has to be a classic as far as non-helpful explanations. 😉

Or you can try:

This site helps you locate, obtain, and publish NASA aerospace information and find national and international information pertinent to your research and mission.

A little better.

Access publicly available NASA and NACA reports, conference papers, journal articles, and more. Includes over a quarter-million full-text documents, and links to more than a half-million images and video clips.

Better still.

And then:

NTRS promotes the dissemination of NASA STI to the widest audience possible by allowing NTRS information to be harvested by sites using the Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH). OAI-PMH defines a mechanism for information technology systems to exchange citation information using the open standards HTTP (Hypertext Transport Protocol) and XML (Extensible Markup Language). NTRS is designed to accept and respond to automated requests using OAI-PMH. Automated requests only harvest citation information and not the full-text document images.

Which means you can populate your topic map with data from this source quite easily.

EECS Technical Reports UC Berkeley

Filed under: CS Lectures,Library — Patrick Durusau @ 6:39 pm

EECS Technical Reports UC Berkeley

From the webpage:

The EECS Technical Memorandum Series provides a dated archive of EECS research. It includes Ph.D. theses and master’s reports as well as technical documents that complement traditional publication media such as journals. For example, technical reports may document work in progress, early versions of results that are eventually published in more traditional media, and supplemental information such as long proofs, software documentation, code listings, or elaborated examples.

Technical reports listed here include the EECS Technical Report series (started in October 2005), the CS Technical Report series (from 1982 to 2005), and the ERL Technical report series (from 1984 to 2005, plus selected titles from before 1984). Full text is included for the EECS and CS series, but not for the ERL series. In the case of the ERL series, full text may be available on other web sites (such as the personal web pages of the authors).

September 1, 2011

What every computer science major should know

Filed under: CS Lectures — Patrick Durusau @ 6:02 pm

What every computer science major should know by Matthew Might.

Matthew is an assistant professor in the CS department at the University of Utah.

I have seen similar lists but this one struck me as particularly well-organized.

You may enjoy scanning the index of his blog posts.

August 18, 2011

Introduction to Databases

Filed under: CS Lectures,Database,SQL — Patrick Durusau @ 6:50 pm

Introduction to Databases by Jennifer Widom.

Course Description:

This course covers database design and the use of database management systems for applications. It includes extensive coverage of the relational model, relational algebra, and SQL. It also covers XML data including DTDs and XML Schema for validation, and the query and transformation languages XPath, XQuery, and XSLT. The course includes database design in UML, and relational design principles based on dependencies and normal forms. Many additional key database topics from the design and application-building perspective are also covered: indexes, views, transactions, authorization, integrity constraints, triggers, on-line analytical processing (OLAP), and emerging “NoSQL” systems.

The third free Stanford course being offered this Fall.

The others are: Introduction to Artificial Intelligence and Introduction to Machine Learning.

As of today, the AI course has a registration of 84,000 from 175 countries. I am sure the machine learning with Ng and the database class will post similar numbers.

My only problem is that I lack the time to take all three while working full time. Best hope is for an annual repeat of these offerings.

August 17, 2011

Machine Learning – Stanford Class

Filed under: CS Lectures,Machine Learning — Patrick Durusau @ 6:48 pm

Machine Learning – Stanford Class

From the course description:

This course provides a broad introduction to machine learning, datamining, and statistical pattern recognition. Topics include: (i) Supervised learning (parametric/non-parametric algorithms, support vector machines, kernels, neural networks). (ii) Unsupervised learning (clustering, dimensionality reduction, recommender systems, deep learning). (iii) Best practices in machine learning (bias/variance theory; innovation process in machine learning and AI). (iv) Reinforcement learning. The course will also draw from numerous case studies and applications, so that you’ll also learn how to apply learning algorithms to building smart robots (perception, control), text understanding (web search, anti-spam), computer vision, medical informatics, audio, database mining, and other areas.

A free Stanford class on machine learning being taught by Professor Andrew Ng!

Over 200,000 people have viewed Professor Ng’s machine learning lectures on YouTube. Now you can participate and even get a certificate of accomplishment.

I am already planning to take the free Introduction to Artificial Intelligence class at Stanford so I can only hope they repeat Machine Learning next year.

August 15, 2011

Skiena’s Algorithms Lectures

Filed under: Algorithms,CS Lectures — Patrick Durusau @ 7:31 pm

Skiena’s Algorithms Lectures by Steven Skiena, Stony Brook University.

From the website:

Below are audio, video and lecture sides for 1997 and 2007. Since the lectures are 10 years apart some of the topics covered by the course have changed. The 1997 lectures have a better quality video and audio than the 2007, although the 2007 covers the newer material and has better lecture notes.

If you found this useful also check out the video lectures of my Discrete Mathematics, Computational Biology, and Computational Finance courses.

I have the first edition of “The Algorithm Design Manual,” which is now out in a second edition. Guess it is time for an upgrade. 😉

There are going to be startups that re-implement assumptions based on prior hardware limitations and those who have a competitive advantage. Which one do you want to be?

Saw this in a tweet from @CompSciFact.

August 7, 2011

Computational Fairy Tales

Filed under: Algorithms,CS Lectures — Patrick Durusau @ 7:07 pm

Computational Fairy Tales by Jeremy Kubica.

From the post:

Computer science concepts as told through fairy tales.

Quite an interesting collection of stories.

March 7, 2011

NPTEL – Computer Science

Filed under: CS Lectures,Dataset — Patrick Durusau @ 7:08 am

NPTEL – Computer Science

An extensive set of computer science lectures courtesy of a joint venture of the Indian Institutes of Technology and the Indian Institute of Science.

I listed this both as a CS lecture and a dataset as it occurs to me that it would be really useful to have a topic map of online CS courses.

If a student doesn’t “get” a concept when explained in one lecture, another approach, by another lecturer, could turn the trick.

Not something I am going to get to soon but the type of thing I need to create as a framework to capture that sort of information as I encounter it.

Or even better a framework to which others could contribute to a map as they find such resources.

Seed it with courses from NPTEL, MIT, Stanford and maybe a couple of other places. Enough to make it worthwhile on its own.

Something to think about.

Shout out if you are interested or want to take the lead.

February 27, 2011

You and Your Research

Filed under: CS Lectures — Patrick Durusau @ 8:17 pm

You and Your Research

Richard Hamming (yes, that Hamming)

Intro:

The title of my talk is, “You and Your Research.” It is not about managing research, it is about how you individually do your research. I could give a talk on the other subject– but it’s not, it’s about you. I’m not talking about ordinary run-of-the-mill research; I’m talking about great research. And for the sake of describing great research I’ll occasionally say Nobel-Prize type of work. It doesn’t have to gain the Nobel Prize, but I mean those kinds of things which we perceive are significant things. Relativity, if you want, Shannon’s information theory, any number of outstanding theories– that’s the kind of thing I’m talking about.

I happened upon this quite by accident.

It may be known by every person in involved in topic maps, semantic web, ontology and similar work. Or not.

In any event, I think it is worth pointing out, even as repetition for some of you.

I think it has a great deal of relevance both for the development of topic map software as well as topic maps per se.

February 4, 2011

Erlang Factory – SF Bay Area 2010
2011 Coming Up!

Filed under: Conferences,CS Lectures,Erlang — Patrick Durusau @ 8:51 am

Erlang Factory – SF Bay Area 2010

From the website:

The Erlang Factory SFBay Area was a resounding success with 34 speakers delivering talks in three tracks to an audience of over 120! The event was held at the San Francisco Airport Hilton and proved to be the largest Erlang event in the US so far, overtaking last year’s despite the continuing effects of the downturn in the marketplace.

There were delegates and speakers from Argentina, Brazil, Israel, Japan, Canada, Sweden, Denmark, Germany, France, and Italy as well as from all parts of the US. This resulted in a very stimulating environment where Erlang was discussed and user’s experiences compared.

The long term and successful use of Erlang in telecommunications makes me suspect that it has a lot to offer designers of distributed topic map systems.

The presentations and slides from the 2010 conference are available for your viewing.

The Erlang Factory – SF Bay Area 2011 conference is coming up, 21-25 March 2011.

Please post a note if you are working on topic maps using Erlang. Thanks!

February 3, 2011

Software Engineering Radio

Filed under: CS Lectures — Patrick Durusau @ 4:36 pm

Software Engineering Radio

I ran across this while following up a lead on a Scala update (to be covered in a separate post).

Just scanning a few of the archived pod-casts I saw materials on Agile programming, JUnit, on being a consultant, NoSQL, etc.

I am reminded that at its inception and even now, in the better projects, software projects aren’t limited to programmers or engineers but have a rich mixture of humanists, mathematicians, logic types, historians (of information as well as the domain), librarians, domain specialists, users (not just user representatives), and others.

Not every project needs them in the same proportions or can even afford to have them all.

But re-inventing semantic diversity using IRIs instead of word tokens is a good example of a lack of diversity in both input and decision making for that project.

That diversity argument applies to other aspects of software projects as well, not just to engineers so don’t start feeling too smug.

Humanists need to learn more about software processes, we can all learn from librarians, project leads can learn from users, etc.

Selected Best Paper Awards – 1996 to date

Filed under: CS Lectures — Patrick Durusau @ 4:16 pm

Selected Best Paper Awards – 1996 to date

Jeff Huang has collected the best cs paper awards since 1996 into a single listing.

Three things occur to me:

  1. We all owe Jeff a kind mention for completing such an interesting listing of papers!
  2. We should contribute to this listing to extend it beyond 1996.
  3. At least for students in my class, you choose two papers to summarize and describe how they is relevant to topic maps. (2-3 pages, no citations, one summary due mid-term, the second summary due at the end of the term.)

January 4, 2011

Algorithms – Lecture Notes

Filed under: CS Lectures,String Matching,Subject Identity — Patrick Durusau @ 7:51 am

Algorithms, Jeff Erickson’s lecture notes.

Mentioned in a post on the Theoretical Computer Science blog, What Lecture Notes Should Everyone Read?.

From the introduction:

Despite several rounds of revision, these notes still contain lots of mistakes, errors, bugs, gaffes, omissions, snafus, kludges, typos, mathos, grammaros, thinkos, brain farts, nonsense, garbage, cruft, junk, and outright lies, all of which are entirely Steve Skiena’s fault. I revise and update these notes every time I teach the course, so please let me know if you find a bug. (Steve is unlikely to care.)

The notes are highly amusing and useful to anyone seeking to improve current subject identification (read searching) practices.

December 1, 2010

Hidden Video Courses in Math, Science and Engineering

Filed under: CS Lectures — Patrick Durusau @ 2:08 pm

Hidden Video Courses in Math, Science and Engineering

Pete Skomoroch complied this list of video lectures, some of which are not easy to find. Including lectures by Knuth on the internals of TeX.

A number of the CS lectures are on topic relevant to topic maps.

The holiday season is coming on and you won’t be able to stay at your keyboard/terminal with relatives in the house.

You can always listen to a CS/Math lecture or two on your cellphone.

Your distracted state will convince everyone that you are really concentrating on the game on TV. 😉

« Newer Posts

Powered by WordPress