As explained in @fgrieu answer, you can always create such a function from a regular hash function by taking variations on the IVs or internal constant.
However, if you ask for a clean standardized hash function family, you will be hard pressed to find something satisfying.
If you are wondering why we encounter this dilemna, some additional explanation is required. Hash function families are used by crypto-theorist while practionners prefers hash function (single hash function not in a family and without a key).
The preference of the practionners is easy to understand, it is much more convenient to have this single hash function that everyone uses. No need to bother about the key that need to be used.
Theorists prefer hash function families because some of the properties that we ask of hash functions can be properly defined if you don't use a family. For example, defining a collision-free hash-function family is easy. The definition simply reads: *There exists no efficient adversary that given a key K outputs a collision for Hk.* With a single hash function, there is no such easy definition, because there exists an efficient adversary (in practice, the adversary is hard to find, but it exists nonetheless).
As far as I know, the only known alternative to using hash function families when interested by the theory of hash function is to use the random oracle model.
EDIT: This last sentence is not completely true, I forgot to mention Rogaway's Human Ignorance approach.